arXiv subjects

Moshe Levy

Publications and source records attributed to Moshe Levy.

7 recordsLinked to original sources

arXiv2022

The Security of Deep Learning Defences for Medical Imaging

Deep learning has shown great promise in the domain of medical image analysis. Medical professionals and healthcare providers have been adopting the technology to speed up and enhance their work. These systems use deep neural networks (DNN) which are vulnerable to adversarial samples; images with imperceivable changes that can alter the model's prediction. Researchers have proposed defences which either make a DNN more robust or detect the adversarial samples before they do harm. However, none of these works consider an informed attacker which can adapt to the defence mechanism. We show that an informed attacker can evade five of the current state of the art defences while successfully fooling the victim's deep learning model, rendering these defences useless. We then suggest better alternatives for securing healthcare DNNs from such attacks: (1) harden the system's security and (2) use digital signatures.

cs.CR↗

arXiv2020

Fair and accurate age prediction using distribution aware data curation and augmentation

Deep learning-based facial recognition systems have experienced increased media attention due to exhibiting unfair behavior. Large enterprises, such as IBM, shut down their facial recognition and age prediction systems as a consequence. Age prediction is an especially difficult application with the issue of fairness remaining an open research problem (e.g., predicting age for different ethnicity equally accurate). One of the main causes of unfair behavior in age prediction methods lies in the distribution and diversity of the training data. In this work, we present two novel approaches for dataset curation and data augmentation in order to increase fairness through balanced feature curation and increase diversity through distribution aware augmentation. To achieve this, we introduce out-of-distribution detection to the facial recognition domain which is used to select the data most relevant to the deep neural network's (DNN) task when balancing the data among age, ethnicity, and gender. Our approach shows promising results. Our best-trained DNN model outperformed all academic and industrial baselines in terms of fairness by up to 4.92 times and also enhanced the DNN's ability to generalize outperforming Amazon AWS and Microsoft Azure public cloud systems by 31.88% and 10.95%, respectively.

cs.CV↗

arXiv2020

FOOD: Fast Out-Of-Distribution Detector

Deep neural networks (DNNs) perform well at classifying inputs associated with the classes they have been trained on, which are known as in distribution inputs. However, out-of-distribution (OOD) inputs pose a great challenge to DNNs and consequently represent a major risk when DNNs are implemented in safety-critical systems. Extensive research has been performed in the domain of OOD detection. However, current state-of-the-art methods for OOD detection suffer from at least one of the following limitations: (1) increased inference time - this limits existing methods' applicability to many real-world applications, and (2) the need for OOD training data - such data can be difficult to acquire and may not be representative enough, thus limiting the ability of the OOD detector to generalize. In this paper, we propose FOOD -- Fast Out-Of-Distribution detector -- an extended DNN classifier capable of efficiently detecting OOD samples with minimal inference time overhead. Our architecture features a DNN with a final Gaussian layer combined with the log likelihood ratio statistical test and an additional output neuron for OOD detection. Instead of using real OOD data, we use a novel method to craft artificial OOD samples from in-distribution data, which are used to train our OOD detector neuron. We evaluate FOOD's detection performance on the SVHN, CIFAR-10, and CIFAR-100 datasets. Our results demonstrate that in addition to achieving state-of-the-art performance, FOOD is fast and applicable to real-world applications.

cs.LG↗

arXiv2020

GIM: Gaussian Isolation Machines

In many cases, neural network classifiers are likely to be exposed to input data that is outside of their training distribution data. Samples from outside the distribution may be classified as an existing class with high probability by softmax-based classifiers; such incorrect classifications affect the performance of the classifiers and the applications/systems that depend on them. Previous research aimed at distinguishing training distribution data from out-of-distribution data (OOD) has proposed detectors that are external to the classification method. We present Gaussian isolation machine (GIM), a novel hybrid (generative-discriminative) classifier aimed at solving the problem arising when OOD data is encountered. The GIM is based on a neural network and utilizes a new loss function that imposes a distribution on each of the trained classes in the neural network's output space, which can be approximated by a Gaussian. The proposed GIM's novelty lies in its discriminative performance and generative capabilities, a combination of characteristics not usually seen in a single classifier. The GIM achieves state-of-the-art classification results on image recognition and sentiment analysis benchmarking datasets and can also deal with OOD inputs.

cs.LG↗

arXiv2009

Distance Is Not Dead: Social Interaction and Geographical Distance in the Internet Era

The Internet revolution has made long-distance communication dramatically faster, easier, and cheaper than ever before. This, it has been argued, has decreased the importance of geographic proximity in social interactions, transforming our world into a global village with a borderless society. We argue for the opposite: while technology has undoubtedly increased the overall level of communication, this increase has been most pronounced for local social ties. We show that the volume of electronic communications is inversely proportional to geographic distance, following a Power Law. We directly study the importance of physical proximity in social interactions by analyzing the spatial dissemination of new baby names. Counter-intuitively, and in line with the above argument, the importance of geographic proximity has dramatically increased with the internet revolution.

cs.CY↗

arXiv2000

Market Ecology, Pareto Wealth Distribution and Leptokurtic Returns in Microscopic Simulation of the LLS Stock Market Model

The LLS stock market model is a model of heterogeneous quasi-rational investors operating in a complex environment about which they have incomplete information. We review the main features of this model and several of its extensions. We study the effects of investor heterogeneity and show that predation, competition, or symbiosis may occur between different investor populations. The dynamics of the LLS model lead to the empirically observed Pareto wealth distribution. Many properties observed in actual markets appear as natural consequences of the LLS dynamics: truncated Levy distribution of short-term returns, excess volatility, a return autocorrelation "U-shape" pattern, and a positive correlation between volume and absolute returns.

cond-mat.stat-mech↗

arXiv1998

Generic Emergence of Power Law Distributions and Lévy-Stable Intermittent Fluctuations in Discrete Logistic Systems

The dynamics of generic stochastic Lotka-Volterra (discrete logistic) systems of the form \cite{Solomon96a} $w_i (t+1) = λ(t) w_i (t) + a {\bar w (t)} - b w_i (t) {\bar w(t)}$ is studied by computer simulations. The variables $w_i$, $i=1,...N$, are the individual system components and ${\bar w (t)} = {1\over N} \sum_i w_i (t)$ is their average. The parameters $a$ and $b$ are constants, while $λ(t)$ is randomly chosen at each time step from a given distribution. Models of this type describe the temporal evolution of a large variety of systems such as stock markets and city populations. These systems are characterized by a large number of interacting objects and the dynamics is dominated by multiplicative processes. The instantaneous probability distribution $P(w,t)$ of the system components $w_i$, turns out to fulfill a (truncated) Pareto power-law $P(w,t) \sim w^{-1-α}$. The time evolution of ${\bar w (t)} $ presents intermittent fluctuations parametrized by a truncated Lévy distribution of index $α$, showing a connection between the distribution of the $w_i$'s at a given time and the temporal fluctuations of their average.

adap-org↗