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,694 papers · 148 categories

Trend · papers per month

105210314419 · Jun 202019922001200920172026
48 results for Adversarial Regularization

This study connects Jacobian regularization to adversarial robustness and improves generalization.

problem Adversarial attacks make deep neural networks vulnerable.
method Developed a connection between Jacobian regularization and adversarial training, and established robust generalization gaps.
result Jacobian norms are related to both standard and robust generalization.

New algorithm improves robustness by more regularization on less robust samples.

problem Improving robustness against adversarial attacks.
method Proposes a new adversarial training algorithm that applies more regularization to data vulnerable to adversarial attacks.
result Empirically superior to other existing algorithms, achieving state-of-the-art performance in generalization and robustness.

ALPS improves neural network robustness and generalization.

problem Challenges in designing effective regularization schemes for adversarial robustness.
method Adversarial Labelling of Perturbed Samples (ALPS) using synthetic samples and min-max formulation.
result ALPS achieves state-of-the-art regularization performance and adversarial robustness.

The paper proposes effective margin regularization to improve adversarial robustness in deep neural networks.

problem Adversarial vulnerability of deep neural networks (DNNs).
method Regularization of effective weight norm during training to maximize effective margins.
result Effective margin regularization (EMR) boosts adversarial robustness in both standard and adversarial training.

In this work we revisit gradient regularization for adversarial robustness with some new ingredients. First, we derive new per-image theoretical robustness bounds based on local gradient information. These bounds strongly motivate input gradient regularization. Second, we implement a scaleable version of input gradient…

2019-05-27abs ↗pdf ↗

The paper shows how policy regularization acts like an adversary to improve robustness.

problem Improving robustness of learned policies in reinforcement learning.
method Using convex duality, the paper characterizes adversarial reward perturbations and provides generalization guarantees.
result Policy regularization acts as an adversary to improve robustness against worst-case reward perturbations.

SOAR improves deep networks' robustness against adversarial examples.

problem Improving deep neural networks' robustness against adversarial examples.
method Formulated adversarial robustness problem under robust optimization framework, approximated loss function using second-order Taylor series expansion.
result SOAR significantly improves robustness of networks against adversarial perturbations.

Study compares adversarial regularization to sole supervision in machine learning.

problem Understanding when adversarial regularization outperforms sole supervision.
method Examines vanishing gradient, iteration complexity, gradient flow, and convergence in both paradigms.
result Adversarial regularization accelerates gradient descent and improves generalization.

Proposes a new method to improve deep model security against adversarial deformations.

problem Deep neural networks' resistance to adversarial attacks, especially location perturbations.
method Regularizes flow gradients to provide a tighter bound and improve model resistance.
result Models trained with flow gradient regularization show better resistance to adversarial deformations compared to input gradient regularization and adversarial training.

The paper examines how adversarial training and noise affect neural network performance.

problem Overfitting in adversarial training and data augmentation.
method Adversarial training and data augmentation with noise in the context of regularized regression in RKHS.
result Appropriate regularization can prevent overfitting and improve performance.

Adversarial robustness has become an important research topic given empirical demonstrations on the lack of robustness of deep neural networks. Unfortunately, recent theoretical results suggest that adversarial training induces a strict tradeoff between classification accuracy and adversarial robustness. In this paper,…

2018-10-09abs ↗pdf ↗

This work analyzes how to choose regularization norms for adversarial training in high dimensions.

problem Choosing the right regularization norm for adversarial training in high-dimensional settings.
method Derives asymptotic descriptions and uniform convergence bounds for robust, regularized empirical risk minimizers.
result Characterizes the relationship between perturbation size and optimal regularization choice.

Noisy labels often occur in vision datasets, especially when they are obtained from crowdsourcing or Web scraping. We propose a new regularization method, which enables learning robust classifiers in presence of noisy data. To achieve this goal, we propose a new adversarial regularization scheme based on the Wasserstei…

2019-04-08abs ↗pdf ↗

Regularized policies are robust to adversarial rewards.

problem Understanding the effects of regularization on policy exploration and robustness.
method Using Fenchel duality to derive the dual problem of the regularized RL objective, showing the optimal policy is robust to adversarial rewards.
result Regularized policies are optimal for a reinforcement learning problem under adversarial reward conditions.

New uniqueness concept for adversarial Bayes classifier.

problem Understanding adversarial Bayes classifiers in binary classification.
method Developed a new notion of uniqueness and analyzed it for a family of one-dimensional data distributions.
result Improved regularity of adversarial Bayes classifiers as perturbation radius increases.

Optimizes quantile and semi-adversarial regret with novel root-logarithmic regularizers.

problem Minimizes regret in adversarial and semi-adversarial online learning.
method FTRL with root-logarithmic regularizers for quantile and semi-adversarial settings.
result Achieves minimax optimal regret bounds in both paradigms.

Generative adversarial networks (GANs) are one of the most popular approaches when it comes to training generative models, among which variants of Wasserstein GANs are considered superior to the standard GAN formulation in terms of learning stability and sample quality. However, Wasserstein GANs require the critic to b…

2019-07-12abs ↗pdf ↗

Efficient regularization mitigates catastrophic overfitting in single-step adversarial training.

problem Catastrophic overfitting in single-step adversarial training.
method ELLE regularization term to enforce local linearity of the loss function.
result Our regularization term effectively mitigates catastrophic overfitting without the drawbacks of previous methods.

Study statistical guarantees for DRO with OT and OT-regularized divergences.

problem Enhancing adversarial robustness in machine learning models.
method Derive concentration inequalities for supervised learning via DRO-based adversarial training.
result First to cover soft-constraint costs and reweighting mechanisms in adversarial training.

Compared with standard supervised learning, the key difficulty in semi-supervised learning is how to make full use of the unlabeled data. A recently proposed method, virtual adversarial training (VAT), smartly performs adversarial training without label information to impose a local smoothness on the classifier, which …

2018-08-18abs ↗pdf ↗

Recent years have seen adversarial losses been applied to many fields. Their applications extend beyond the originally proposed generative modeling to conditional generative and discriminative settings. While prior work has proposed various output activation functions and regularization approaches, some open questions …

2019-01-25abs ↗pdf ↗

State-of-the-art classifiers have been shown to be largely vulnerable to adversarial perturbations. One of the most effective strategies to improve robustness is adversarial training. In this paper, we investigate the effect of adversarial training on the geometry of the classification landscape and decision boundaries…

2018-11-23abs ↗pdf ↗

Adversarial training is an effective methodology for training deep neural networks that are robust against adversarial, norm-bounded perturbations. However, the computational cost of adversarial training grows prohibitively as the size of the model and number of input dimensions increase. Further, training against less…

2019-07-04abs ↗pdf ↗

We propose a novel adversarial training method in feature space that improves model robustness and computational efficiency.

problem Improving model robustness against adversarial input perturbations with computational efficiency.
method Shift from input to feature-space perturbations, reformulating the adversarial training problem in reproducing kernel Hilbert spaces, enabling exact solution of inner maximization and efficient optimization.
result The feature-perturbed formulation is a relaxation of the original problem and provides a regularized estimator that adapts to noise and function smoothness.

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.

Surveying strategies for making machine learning models robust against adversarial attacks.

problem Ensuring machine learning models are robust and reliable in real-world applications.
method Taxonomy of adversarial attacks and defenses, Robust Optimization problem formulation, and survey of methods.
result Surveyed recent results in adversarial example generation, defense mechanisms, and formal robustness certificates.

This work examines how adversarial robustness regularization affects neural network performance.

problem Adversarial robustness regularization leads to performance degradation on natural examples.
method Empirical analysis of neural network generalization and regularization effects.
result Adversarial robustness regularization causes neural networks to become less confident, leading to worse standard performance.

This paper explores how the generalization of substitute classifiers affects the success of black-box adversarial attacks.

problem Understanding the factors driving the transferability of black-box adversarial examples.
method Max-min adversarial example game framework and theoretical generalization bounds.
result Substitute NN with better generalization behavior results in more transferable adversarial examples.

Network Embedding is the task of learning continuous node representations for networks, which has been shown effective in a variety of tasks such as link prediction and node classification. Most of existing works aim to preserve different network structures and properties in low-dimensional embedding vectors, while neg…

2019-08-30abs ↗pdf ↗

A new method improves adversarial robustness and interpretability with reduced training time.

problem Adversarial attacks on deep neural networks.
method A novel regularizer incorporating first and second order information via a quadratic approximation to the adversarial loss.
result Single iteration of the proposed regularizer achieves stronger robustness than prior methods.

Despite the considerable success of convolutional neural networks in a broad array of domains, recent research has shown these to be vulnerable to small adversarial perturbations, commonly known as adversarial examples. Moreover, such examples have shown to be remarkably portable, or transferable, from one model to ano…

2018-12-05abs ↗pdf ↗