mlsanityData to 7 Oct 2026

The Surprising Harmfulness of Benign Overfitting for Adversarial Robustness

arXiv 2401.12236 ↗First posted 19 Jan 2024cs.LG cs.CR stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

Recent empirical and theoretical studies have established the generalization capabilities of large machine learning models that are trained to (approximately or exactly) fit noisy data. In this work, we prove a surprising result that even if the ground truth itself is robust to adversarial examples, and the benignly overfitted model is benign in terms of the ``standard'' out-of-sample risk objective, this benign overfitting process can be harmful when out-of-sample data are subject to adversarial manipulation. More specifically, our main results contain two parts: (i) the min-norm estimator in overparameterized linear model always leads to adversarial vulnerability in the ``benign overfitting'' setting; (ii) we verify an asymptotic trade-off result between the standard risk and the ``adversarial'' risk of every ridge regression estimator, implying that under suitable conditions these two items cannot both be small at the same time by any single choice of the ridge regularization parameter. Furthermore, under the lazy training regime, we demonstrate parallel results on two-layer neural tangent kernel (NTK) model, which align with empirical observations in deep neural networks. Our finding provides theoretical insights into the puzzling phenomenon observed in practice, where the true target function (e.g., human) is robust against adverasrial attack, while beginly overfitted neural networks lead to models that are not robust.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 47 of its 63 references that are in the map. First posted on arXiv 19 Jan 2024.

Builds on

47 of 63 references.

References · 47

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  3. 2013Intriguing properties of neural networkscited by 5,114
  4. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  5. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  6. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
  7. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  8. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
  9. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  10. 2018Robustness May Be at Odds with Accuracycited by 873
  11. 2017Evasion Attacks against Machine Learning at Test Timecited by 686
  12. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
35 more
  1. 2017Exploring Generalization in Deep Learningcited by 595
  2. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
  3. 2020Overfitting in adversarially robust deep learningcited by 504
  4. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
  5. 2018Adversarially Robust Generalization Requires More Datacited by 318
  6. 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 248
  7. 2019Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networkscited by 221
  8. 2019Two models of double descent for weak featurescited by 194
  9. 2018Just Interpolate: Kernel "Ridgeless" Regression Can Generalizecited by 190
  10. 2018To understand deep learning we need to understand kernel learningcited by 186
  11. 2021A Universal Law of Robustness via Isoperimetrycited by 150
  12. 2019Adversarial Training Can Hurt Generalizationcited by 131
  13. 2019Harmless interpolation of noisy data in regressioncited by 121
  14. 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 117
  15. 2018Are adversarial examples inevitable?cited by 113
  16. 2020The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalizationcited by 101
  17. 2018Overfitting or perfect fitting? Risk bounds for classification and regression rules that interpolatecited by 99
  18. 2020Classification vs regression in overparameterized regimes: Does the loss function matter?cited by 97
  19. 2020Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regimecited by 81
  20. 2020Do Wider Neural Networks Really Help Adversarial Robustness?cited by 79
  21. 2020Precise Tradeoffs in Adversarial Training for Linear Regressioncited by 76
  22. 2021Exploring Architectural Ingredients of Adversarially Robust Deep Neural Networkscited by 73
  23. 2019Convergence of Adversarial Training in Overparametrized Neural Networkscited by 58
  24. 2020A law of robustness for two-layers neural networkscited by 54
  25. 2015Explaining the Success of AdaBoost and Random Forests as Interpolating Classifierscited by 45
  26. 2021Benign Overfitting in Multiclass Classification: All Roads Lead to Interpolationcited by 41
  27. 2022The curse of overparametrization in adversarial training: Precise analysis of robust generalization for random features regressioncited by 40
  28. 2022The Implicit Bias of Benign Overfittingcited by 38
  29. 2013Margins, Shrinkage, and Boostingcited by 35
  30. 2021Towards an Understanding of Benign Overfitting in Neural Networkscited by 29
  31. 2023More is Better in Modern Machine Learning: when Infinite Overparameterization is Optimal and Overfitting is Obligatorycited by 17
  32. 2021Interpolation can hurt robust generalization even when there is no noisecited by 15
  33. 2022Generalization Bounds for Stochastic Gradient Descent via Localized varepsilon-Coverscited by 11
  34. 2021Provable Robustness of Adversarial Training for Learning Halfspaces with Noisecited by 10
  35. 2023Benign Overfitting in Deep Neural Networks under Lazy Trainingcited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 2; 2026: 2.

7 papers.