The Price of Implicit Bias in Adversarially Robust Generalization
Not on the map. Why?
Abstract (arXiv)
We study the implicit bias of optimization in robust empirical risk minimization (robust ERM) and its connection with robust generalization. In classification settings under adversarial perturbations with linear models, we study what type of regularization should ideally be applied for a given perturbation set to improve (robust) generalization. We then show that the implicit bias of optimization in robust ERM can significantly affect the robustness of the model and identify two ways this can happen; either through the optimization algorithm or the architecture. We verify our predictions in simulations with synthetic data and experimentally study the importance of implicit bias in robust ERM with deep neural networks.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 53 of its 77 references that are in the map. First posted on arXiv 7 Jun 2024.
Builds on
53 of 77 references.
References · 53
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2023Universal and Transferable Adversarial Attacks on Aligned Language Modelscited by 3,104
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
- 2021Convex optimizationcited by 2,515
- 2016Adversarial examples in the physical worldcited by 1,769
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,268
- 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 953
- 2016Adversarial Machine Learning at Scalecited by 936
38 more
- 2018Robustness May Be at Odds with Accuracycited by 880
- 2015The Limitations of Deep Learning in Adversarial Settingscited by 790
- 2020Fast is better than free: Revisiting adversarial trainingcited by 727
- 2017Evasion Attacks against Machine Learning at Test Timecited by 689
- 2017Spectrally-normalized margin bounds for neural networkscited by 686
- 2020RobustBench: a standardized adversarial robustness benchmarkcited by 661
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
- 2019Adversarial Training for Free!cited by 643
- 2017Adversarial Examples for Evaluating Reading Comprehension Systemscited by 571
- 2020Overfitting in adversarially robust deep learningcited by 506
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 405
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 342
- 2017Implicit Regularization in Matrix Factorizationcited by 322
- 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 320
- 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 314
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 306
- 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 266
- 2018Implicit Bias of Gradient Descent on Linear Convolutional Networkscited by 251
- 2023Better Diffusion Models Further Improve Adversarial Trainingcited by 208
- 2019You Only Propagate Once: Accelerating Adversarial Training via Maximal Principlecited by 183
- 2018Gradient descent aligns the layers of deep linear networkscited by 182
- 2018Rademacher Complexity for Adversarially Robust Generalizationcited by 132
- 2021Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationcited by 132
- 2018Are adversarial examples inevitable?cited by 113
- 2022On the Implicit Bias in Deep-Learning Algorithmscited by 86
- 2018Adversarial examples from computational constraintscited by 80
- 2018Adversarial vulnerability for any classifiercited by 78
- 2020Implicit Bias in Deep Linear Classification: Initialization Scale vs Training Accuracycited by 71
- 2019Generalization bounds for deep convolutional neural networkscited by 59
- 2019Lexicographic and Depth-Sensitive Margins in Homogeneous and Non-Homogeneous Deep Modelscited by 53
- 2020Adversarial Learning Guarantees for Linear Hypotheses and Neural Networkscited by 47
- 2019Adversarial Robustness May Be at Odds With Simplicitycited by 39
- 2013Margins, Shrinkage, and Boostingcited by 35
- 2015Understanding Adversarial Training: Increasing Local Stability of Neural Nets through Robust Optimizationcited by 32
- 2022Gradient Methods Provably Converge to Non-Robust Networkscited by 27
- 2019Hypothesis Set Stability and Generalizationcited by 23
- 2023The Double-Edged Sword of Implicit Bias: Generalization vs. Robustness in ReLU Networkscited by 23
- 2022What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness?cited by 21
50 most cited of 53 All 53 (JSON)
Built on by
Citing papers per year: 2024: 2; 2025: 1; 2026: 2.
5 papers.
- 2024Flavors of Margin: Implicit Bias of Steepest Descent in Homogeneous Neural Networkscited by 18
- 2024On the Geometry of Regularization in Adversarial Training: High-Dimensional Asymptotics and Generalization Boundscited by 4
- 2026Never Saddle for Reparameterized Steepest Descent as Mirror Flowcited by 4
- 2025On the Existence of Consistent Adversarial Attacks in High-Dimensional Linear Classificationcited by 2
- 2026The Fourth Quadrant: A Stylized View of Benign Misfittingcited by 0
- 2026The Fourth Quadrant: A Stylized View of Benign Misfitting2 Aug 2026
- 2026Never Saddle for Reparameterized Steepest Descent as Mirror Flow2 Mar 2026
- 2025On the Existence of Consistent Adversarial Attacks in High-Dimensional Linear Classification14 Jun 2025
- 2024Flavors of Margin: Implicit Bias of Steepest Descent in Homogeneous Neural Networks29 Oct 2024
- 2024On the Geometry of Regularization in Adversarial Training: High-Dimensional Asymptotics and Generalization Bounds21 Oct 2024