Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

236471707942 · Jun 202019922001200920172026
48 results for region adversarial training

This paper proposes a new method to improve adversarial robustness of DNNs by focusing on semantic information.

problem Vulnerability of deep neural networks to adversarial attacks.
method Region adversarial training (RAT) that generates a single adversarial perturbation carrying semantic information.
result RAT greatly improves adversarial robustness with a small dataset and defends against FGSM attacks.

This paper examines how adversarial perturbations affect model performance and equilibrium learning.

problem Adversarial perturbations and covariate shifts impact model performance and equilibrium learning.
method Characterizes the extrapolation region in regression and classification, analyzes dynamics of adversarial learning games.
result Establishes two directional convergence results: a blessing in regression and a curse in classification.

Simple regional perturbations maintain model transferability while reducing adversarial example distortion.

problem Comparing efficacy of regional adversarial attacks without complex methods.
method Developed a simple regional adversarial perturbation attack using cross-entropy sign.
result Localized adversarial examples require significantly less LpL_p norm distortion compared to non-local counterparts.

Restricted Boltzmann Machines (RBMs) are a class of generative neural network that are typically trained to maximize a log-likelihood objective function. We argue that likelihood-based training strategies may fail because the objective does not sufficiently penalize models that place a high probability in regions where…

2018-04-23abs ↗pdf ↗

PARADE generates provably robust adversarial examples for deep networks.

problem Creating robust adversarial examples for deep neural networks.
method Iterative refinement of adversarial regions using optimization to ensure robustness under various perturbations.
result PARADE finds large, provably robust adversarial regions with high volume under various perturbations.

Adversarial training improves linear regression solutions, offering robustness against small perturbations.

problem Vulnerability of linear models to adversarial perturbations.
method Formulated as a min-max problem, adversarial training minimizes the best solution under worst-case attacks.
result Adversarial training yields the minimum-norm interpolating solution in overparameterized models, equivalent to parameter shrinking methods in underparameterized models.

We introduce the "Energy-based Generative Adversarial Network" model (EBGAN) which views the discriminator as an energy function that attributes low energies to the regions near the data manifold and higher energies to other regions. Similar to the probabilistic GANs, a generator is seen as being trained to produce con…

2016-09-11abs ↗pdf ↗

The adversarial training procedure proposed by Madry et al. (2018) is one of the most effective methods to defend against adversarial examples in deep neural networks (DNNs). In our paper, we shed some lights on the practicality and the hardness of adversarial training by showing that the effectiveness (robustness on t…

2019-01-15abs ↗pdf ↗

The study reveals how adversarial perturbations can include class features for generalization.

problem Understanding why adversarial examples deceive neural networks and transfer between networks.
method A one-hidden-layer network trained on mutually orthogonal samples.
result Adversarial perturbations, even of a few pixels, contain sufficient class features for generalization.

Localized uncertainty attacks target uncertain regions to create imperceptible adversarial examples.

problem Adversarial examples that are imperceptible to humans and strong under deterministic classifiers.
method Localized uncertainty attacks by perturbing uncertain regions, using predictive uncertainty or surrogate models.
result Localized uncertainty attacks produce strong adversarial examples that retain input similarity.

Enhances neural network robustness with polyhedral envelope regularization.

problem Improving neural network robustness against adversarial attacks.
method Introduces polyhedral envelope regularization to bound the robustness region.
result Demonstrates improved robustness guarantees with minimal computational overhead.

Neural networks have been proven to be vulnerable to a variety of adversarial attacks. From a safety perspective, highly sparse adversarial attacks are particularly dangerous. On the other hand the pixelwise perturbations of sparse attacks are typically large and thus can be potentially detected. We propose a new black…

2019-09-11abs ↗pdf ↗

Previous work shows that adversarially robust generalization requires larger sample complexity, and the same dataset, e.g., CIFAR-10, which enables good standard accuracy may not suffice to train robust models. Since collecting new training data could be costly, we focus on better utilizing the given data by inducing t…

2019-05-25abs ↗pdf ↗

We explore adversarial robustness in the setting in which it is acceptable for a classifier to abstain---that is, output no class---on adversarial examples. Adversarial examples are small perturbations of normal inputs to a classifier that cause the classifier to give incorrect output; they present security and safety …

2019-11-25abs ↗pdf ↗

Machine learning algorithms are vulnerable to poisoning attacks: An adversary can inject malicious points in the training dataset to influence the learning process and degrade the algorithm's performance. Optimal poisoning attacks have already been proposed to evaluate worst-case scenarios, modelling attacks as a bi-le…

2019-06-18abs ↗pdf ↗

Estimates the upper bound of linear regions in spheres centered at specific data points in ReLU neural networks.

problem Bounding the number of linear regions in specific areas of neural networks using ReLU activations.
method Developed a method to estimate the upper bound of linear regions in any sphere within the input space of a ReLU neural network.
result The boundaries of linear regions move away from training data points during training, and spheres centered at these points contain more regions than arbitrary points.

Deep Neural Networks are quite vulnerable to adversarial perturbations. Current state-of-the-art adversarial attack methods typically require very time consuming hyper-parameter tuning, or require many iterations to solve an optimization based adversarial attack. To address this problem, we present a new family of trus…

2018-12-16abs ↗pdf ↗

Deep neural networks' decision boundaries move closer to natural images during training.

problem Limited understanding of deep neural networks' decision boundaries and regions.
method Examined the minimum distance of data points to the decision boundary over training.
result The decision boundary moves closer to natural images during training, even in late epochs.

We propose a reinforcement learning solution to the \emph{soccer dribbling task}, a scenario in which a soccer agent has to go from the beginning to the end of a region keeping possession of the ball, as an adversary attempts to gain possession. While the adversary uses a stationary policy, the dribbler learns the best…

2013-05-28abs ↗pdf ↗

Develops a new non-adversarial framework for better generative models.

problem Inaccurate approximation of target distribution in latent space.
method Tessellated Wasserstein Auto-Encoders (TWAE) using centroidal Voronoi tessellation (CVT) to tessellate latent space.
result Significantly enhances generative performance in terms of FID compared to existing models.

Reliably detecting anomalies in a given set of images is a task of high practical relevance for visual quality inspection, surveillance, or medical image analysis. Autoencoder neural networks learn to reconstruct normal images, and hence can classify those images as anomalies, where the reconstruction error exceeds som…

2019-01-18abs ↗pdf ↗

SaliencyMix augments images with salient patches to improve model generalization.

problem Improving deep learning model generalization through better data augmentation.
method Carefully selects salient patches from images and mixes them with the target image.
result Achieves state-of-the-art top-1 error rates and robustness against adversarial attacks.

New expressive losses improve adversarial robustness without sacrificing accuracy.

problem Training networks for robustness at the expense of accuracy.
method Formalizing expressivity, using convex combinations of adversarial attacks and IBP bounds.
result Trivial expressive losses yield state-of-the-art results in various settings.

New approach makes adversarial examples less suspicious without changing perceptual salience.

problem Robustness of deep neural networks to unsuspicious adversarial examples.
method Splitting images into foreground and background, allowing larger perturbations in background while maintaining low cognitive salience.
result Dual-perturbation attacks are effective against classifiers robust to conventional attacks and adversarial training yields more robust classifiers.

Domain adaptation refers to the problem of leveraging labeled data in a source domain to learn an accurate model in a target domain where labels are scarce or unavailable. A recent approach for finding a common representation of the two domains is via domain adversarial training (Ganin & Lempitsky, 2015), which attempt…

2018-02-23abs ↗pdf ↗

Adversarial robustness improved by abstaining from decisions.

problem Improving classification accuracy in the presence of adversarial perturbations.
method Introducing an abstain option in binary classification problems, using metrics to quantify performance and robustness.
result There is a tradeoff between nominal performance and adversarial robustness.

Deep generative models improve global precipitation forecasts.

problem Accurately forecasting extreme rainfall is challenging and costly.
method Trained a Conditional Generative Adversarial Network (CorrectorGAN) to correct and super-resolve global precipitation forecasts.
result CorrectorGAN produces high-resolution, bias-corrected forecasts in seconds.

The paper learns perturbation sets from data to improve robustness in machine learning.

problem Real-world perturbations are not well characterized in adversarial defenses.
method A conditional generator defines perturbation sets over latent space, with properties for quality measured.
result Learned perturbation sets generate diverse, meaningful perturbations and improve model robustness.

Neural networks classify OOD images by their nearest neighbor in training data.

problem Understanding out-of-distribution prediction behavior of neural networks.
method Nearest category generalization (NCG) measure to assess OOD prediction accuracy.
result Adversarially robust networks have higher NCG accuracy than natural training, indicating local regularization impacts decision regions.

This paper studies adversarial attacks on Gaussian process bandits.

problem Adversarial attacks on Gaussian process bandits to manipulate optimal function regions.
method Proposes various adversarial attack methods on GP bandits, including white-box and black-box attacks.
result Adversarial attacks can force GP bandits to optima in target regions even with low attack budgets.

Proposes a method to identify critical regions in neural networks using adversarial attacks.

problem Capturing uncertainty in neural networks near decision boundaries.
method Adversarial attack method to derive uncertainty from input perturbations.
result The proposed method outperforms other uncertainty methods in capturing model uncertainty.

PaDGAN generates diverse, high-quality designs with improved performance.

problem Lack of diversity and performance improvement in generated designs.
method Integrates Determinantal Point Processes for diversity and quality, using GAN framework.
result PaDGAN generates higher quality designs with better diversity and without mode collapse.

Adversarial examples are considered a serious issue for safety critical applications of AI, such as finance, autonomous vehicle control and medicinal applications. Though significant work has resulted in increased robustness of systems to these attacks, systems are still vulnerable to well-crafted attacks. To address t…

2018-12-06abs ↗pdf ↗

RGI improves robustness of GAN-inversion for image restoration and anomaly detection.

problem Robustness of GAN-inversion to unknown gross corruptions.
method Proposes RGI and R-RGI methods with provable robustness guarantees.
result Restored images and corrupted region masks converge to ground truth under mild assumptions.

AROS uses Lyapunov-stabilized embeddings to improve out-of-distribution detection robustness against adversarial attacks.

problem Robust out-of-distribution (OOD) detection against adversarial attacks.
method Neural Ordinary Differential Equations (NODEs) with Lyapunov stability theory for generating robust embeddings.
result Improves robust detection performance significantly, e.g., from 37.8% to 80.1% on CIFAR-10 vs. CIFAR-100.

In this paper, we aim to solve for unsupervised domain adaptation of classifiers where we have access to label information for the source domain while these are not available for a target domain. While various methods have been proposed for solving these including adversarial discriminator based methods, most approache…

2019-06-08abs ↗pdf ↗