Asymptotic Behavior of Adversarial Training Estimator under ℓ_∞-Perturbation
Not on the map. Why?
Abstract (arXiv)
Adversarial training has been proposed to protect machine learning models against adversarial attacks. This paper focuses on adversarial training under ℓ_∞-perturbation, which has recently attracted much research attention. The asymptotic behavior of the adversarial training estimator is investigated in the generalized linear model. The results imply that the asymptotic distribution of the adversarial training estimator under ℓ_∞-perturbation could put a positive probability mass at 0 when the true parameter is 0, providing a theoretical guarantee of the associated sparsity-recovery ability. Alternatively, a two-step procedure is proposed -- adaptive adversarial training, which could further improve the performance of adversarial training under ℓ_∞-perturbation. Specifically, the proposed procedure could achieve asymptotic variable-selection consistency and unbiasedness. Numerical experiments are conducted to show the sparsity-recovery ability of adversarial training under ℓ_∞-perturbation and to compare the empirical performance between classic adversarial training and adaptive adversarial training.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 40 references that are in the map. First posted on arXiv 27 Jan 2024.
Builds on
20 of 40 references.
References · 20
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2018Adversarially Robust Generalization Requires More Datacited by 318
- 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
- 2018Rademacher Complexity for Adversarially Robust Generalizationcited by 132
- 2018A modern maximum-likelihood theory for high-dimensional logistic regressioncited by 79
- 2020Precise Statistical Analysis of Classification Accuracies for Adversarial Trainingcited by 49
- 2022The curse of overparametrization in adversarial training: Precise analysis of robust generalization for random features regressioncited by 40
- 2020Provable tradeoffs in adversarially robust classificationcited by 39
- 2020More Data Can Expand the Generalization Gap Between Adversarially Robust and Standard Modelscited by 27
- 2019Confidence Regions in Wasserstein Distributionally Robust Estimationcited by 24
- 2020On the Generalization Properties of Adversarial Trainingcited by 23
- 2022Overparameterized Linear Regression under Adversarial Attackscited by 21
8 more
- 2022The Multimarginal Optimal Transport Formulation of Adversarial Multiclass Classificationcited by 21
- 2023Regularization properties of adversarially-trained linear regressioncited by 17
- 2020The Asymptotic Distribution of the MLE in High-dimensional Logistic Models: Arbitrary Covariancecited by 14
- 2023Statistical Limit Theorems in Distributionally Robust Optimizationcited by 7
- 2020On Connections between Regularizations for Improving DNN Robustnesscited by 5
- 2013On model selection consistency of regularized M-estimatorscited by 3
- 2022Surprises in adversarially-trained linear regressioncited by 2
- 2023Adjusted Wasserstein Distributionally Robust Estimator in Statistical Learningcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.