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

Trend · papers per month

100199299398 · Jun 202019922001200920172026
48 results for adversarial consistency

Adversarial consistency depends on the uniqueness of adversarial Bayes classifiers.

problem Consistency of adversarial surrogate losses is not guaranteed.
method Connected consistency of adversarial surrogate losses to the uniqueness of adversarial Bayes classifiers.
result A convex surrogate loss is statistically consistent for adversarial learning if and only if the adversarial Bayes classifier is unique.

Study on calibration and consistency of adversarial surrogate losses.

problem Designing robust classifiers with theoretical guarantees.
method Extensive analysis of H-calibration and H-consistency of adversarial surrogate losses.
result Some convex loss functions and supremum-based convex losses are not H-calibrated for important hypothesis sets.

Paper bounds convergence rate of adversarial surrogate risk.

problem Vulnerability of binary classification models to adversarial attacks.
method Characterizes conditions for adversarial consistency and provides surrogate risk bounds.
result Surrogate risk bounds quantify the rate of convergence of adversarial classification risk.

This paper improves adversarial robustness of deep learning models.

problem Vulnerability of machine learning models to adversarial perturbations.
method Analyzes adversarial training for linear regression and neural networks, incorporating L1 penalty.
result Incorporating L1 penalty leads to consistent adversarially robust estimation in high-dimensional settings.

New findings on universal learning in contextual bandits with adversarial rewards.

problem Learning in contextual bandits with time-varying, adversarial rewards.
method Characterization of learnable processes and necessary/sufficient conditions for universal learning.
result Optimistic universal learning for contextual bandits with adversarial rewards is impossible in general.

Study reveals how high-dimensional models are vulnerable to consistent adversarial attacks.

problem Understanding the vulnerability of high-dimensional linear classifiers to adversarial attacks.
method Introducing a new error metric to quantify model vulnerability, and rigorously characterizing these metrics in asymptotic settings.
result As models become more overparameterized, their vulnerability to label-preserving perturbations increases.

This research analyzes the consistency of convex and nonconvex surrogate losses for adversarially robust classification.

problem Ensuring classifiers are robust to adversarial perturbations.
method Analysis of convex and nonconvex surrogate losses through the lens of calibration.
result No convex surrogate loss is calibrated with respect to the adversarial 0-1 loss for linear models, but nonconvex losses can be calibrated under certain conditions.

This study examines when non-parametric methods are robust to adversarial examples.

problem Understanding when non-parametric methods are robust to adversarial examples.
method Examined general non-parametric methods and established conditions for r-consistency.
result Non-parametric methods like nearest neighbors and kernel classifiers are r-consistent when data is well-separated, while histograms are not.

SARD improves adversarial robustness in two-stage L2D systems.

problem Adversarial attacks can manipulate query allocation in two-stage L2D systems.
method Introduces SARD, a convex learning algorithm with provable guarantees.
result SARD significantly improves robustness under adversarial attacks while maintaining strong clean performance.

Study on HH-consistency bounds for machine learning surrogates.

problem Estimating target loss error relative to surrogate loss error in machine learning.
method Developed HH-consistency bounds for various surrogates and loss functions.
result Stronger guarantees than existing methods, offering distribution-dependent and -independent bounds.

Study on learning strategies in adaptive Markov games with policy regret as metric.

problem Learning in dynamic Markov games with adaptive opponents is challenging.
method Introduced policy regret as a new learning metric and developed algorithms for consistent adaptive adversaries.
result Achieved T\sqrt{T} policy regret against certain adaptive adversaries.

Theoretical analysis of cross-entropy loss functions and their robustness.

problem Guarantees for using cross-entropy as a surrogate loss function.
method Theoretical analysis of a broad family of loss functions, including cross-entropy.
result First HH-consistency bounds for comp-sum losses and smooth adversarial comp-sum losses.

Deep neural networks have been demonstrated to be vulnerable to backdoor attacks. Specifically, by injecting a small number of maliciously constructed inputs into the training set, an adversary is able to plant a backdoor into the trained model. This backdoor can then be activated during inference by a backdoor trigger…

2019-12-05abs ↗pdf ↗

This paper investigates the theory of robustness against adversarial attacks. It focuses on the family of randomization techniques that consist in injecting noise in the network at inference time. These techniques have proven effective in many contexts, but lack theoretical arguments. We close this gap by presenting a …

2019-02-04abs ↗pdf ↗

Bayes-optimal classifiers are robust to adversarial attacks, unlike CNNs trained on the same data.

problem The vulnerability of modern CNN classifiers to adversarial examples.
method Constructing realistic image datasets and deriving analytic conditions for Bayes-optimal classifiers.
result Bayes-optimal classifiers are robust to adversarial attacks, unlike CNNs trained on the same data.

CycleGAN (Zhu et al. 2017) is one recent successful approach to learn a transformation between two image distributions. In a series of experiments, we demonstrate an intriguing property of the model: CycleGAN learns to "hide" information about a source image into the images it generates in a nearly imperceptible, high-…

2017-12-08abs ↗pdf ↗

Paper tackles robustness in adversarial noise with a meta-optimizer.

problem Sensitivity to adversarial noise hinders machine learning deployment.
method Meta-optimizer learns to robustly optimize models using adversarial examples.
result Meta-optimizer transfers adversarial knowledge to new models without generating new examples.

Improves GAN-based semi-supervised learning with consistency regularization.

problem Lack of consistency in class probability predictions under local perturbations.
method Introduces consistency regularization to GANs, leveraging both local and interpolation consistency.
result Significantly improves performance and achieves new state-of-the-art results.

Adversarial attacks on probabilistic state-space models affect latent state and policy decisions.

problem Robust reinforcement learning under adversarial observability.
method Analyzing adversarial attacks on linear probabilistic state-space models.
result Demonstrating the influence of adversarial observations on latent state and policy decisions.

The paper studies the asymptotic behavior of adversarial training under \ell_\infty-perturbation.

problem Theoretical guarantees for sparsity-recovery in adversarial training.
method Investigation of the asymptotic distribution of the adversarial training estimator in generalized linear models.
result The asymptotic distribution of the adversarial training estimator under \ell_\infty-perturbation could have a positive probability mass at 0 when the true parameter is 0.

Study on robustness in linear regression models, focusing on adversarial perturbations.

problem Understanding and improving robustness in linear regression models to adversarial perturbations.
method Developed a two-stage adversarial learning framework that incorporates model structure information.
result Proved the consistency and developed the Bahadur representation of the adversarially robust estimator.

Ideally, what confuses neural network should be confusing to humans. However, recent experiments have shown that small, imperceptible perturbations can change the network prediction. To address this gap in perception, we propose a novel approach for learning robust classifier. Our main idea is: adversarial examples for…

2018-10-30abs ↗pdf ↗

Generative adversarial network for probabilistic forecasting of random systems.

problem Forecasting random dynamical systems without distributional assumptions.
method Recurrent neural network and generative adversarial network (GAN) with regularization based on maximum mean discrepancy (MMD).
result The proposed model successfully forecasts complex stochastic processes with multiple-step predictions.

CNN-F uses generative feedback to improve neural networks' robustness to perturbations.

problem Neural networks' vulnerability to input perturbations like noise and attacks.
method Enforces self-consistency in neural networks by incorporating generative recurrent feedback.
result CNN-F shows significantly improved adversarial robustness compared to conventional CNNs.

We study the Thompson sampling algorithm in an adversarial setting, specifically, for adversarial bit prediction. We characterize the bit sequences with the smallest and largest expected regret. Among sequences of length TT with k<T2k < \frac{T}{2} zeros, the sequences of largest regret consist of alternating zeros and …

2019-06-21abs ↗pdf ↗

Given a pair of graphs G1G_1 and G2G_2 and a vertex set of interest in G1G_1, the vertex nomination (VN) problem seeks to find the corresponding vertices of interest in G2G_2 (if they exist) and produce a rank list of the vertices in G2G_2, with the corresponding vertices of interest in G2G_2 concentrating, ideally, at…

2019-05-06abs ↗pdf ↗

Meta-learning enables a model to learn from very limited data to undertake a new task. In this paper, we study the general meta-learning with adversarial samples. We present a meta-learning algorithm, ADML (ADversarial Meta-Learner), which leverages clean and adversarial samples to optimize the initialization of a lear…

2018-06-08abs ↗pdf ↗

DART tackles adversarial robustness in domain adaptation without labeled target data.

problem Combining distribution shifts and adversarial examples in unsupervised domain adaptation.
method DART framework that combines standard UDA methods with a generalization bound for adversarial target loss.
result DART significantly enhances model robustness to adversarial attacks compared to state-of-the-art methods.

Improved inter-scanner MS lesion segmentation through adversarial training.

problem Variability in MRI scanner or protocol differences affect automated lesion segmentation accuracy.
method Trained a CNN base model and a discriminator model adversarially on multi-scanner longitudinal data.
result Adversarial training improves inter-scanner consistency of lesion segmentations.

Adaptive networks improve model robustness through conditional normalization.

problem Limited robustness of adversarial-trained networks due to network capacity and training samples.
method Proposes a conditional normalization module to adapt networks during adversarial training.
result Adaptive networks outperform both clean validation accuracy and robustness compared to non-adaptive counterparts.

Small, carefully crafted perturbations called adversarial perturbations can easily fool neural networks. However, these perturbations are largely additive and not naturally found. We turn our attention to the field of Autonomous navigation wherein adverse weather conditions such as fog have a drastic effect on the pred…

2020-01-16abs ↗pdf ↗

Paper improves adversarial training using a learned optimizer.

problem Improving robustness of deep learning models against adversarial attacks.
method Empirically identified PGD attack's limitations and used a learning-to-learn framework to train an adaptive inner optimizer.
result The proposed framework consistently improves model robustness over traditional adversarial training methods.