Maximizing the robust margin provably overfits on noiseless data
2021-06-18ICML Workshop AML 2021Code Available0· sign in to hype
Konstantin Donhauser, Alexandru Tifrea, Michael Aerni, Reinhard Heckel, Fanny Yang
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/michaelaerni/interpolation_robustnessOfficialIn paperjax★ 1
Abstract
Numerous recent works show that overparameterization implicitly reduces variance, suggesting vanishing benefits for explicit regularization in high dimensions. However, this narrative has been challenged by empirical observations indicating that adversarially trained deep neural networks suffer from robust overfitting. While existing explanations attribute this phenomenon to noise or problematic samples in the training data set, we prove that even on entirely noiseless data, achieving a vanishing adversarial logistic training loss is suboptimal compared to regularized counterparts.