Classification and Adversarial examples in an Overparameterized Linear Model: A Signal Processing Perspective
Not on the map. Why?
Abstract (arXiv)
State-of-the-art deep learning classifiers are heavily overparameterized with respect to the amount of training examples and observed to generalize well on "clean" data, but be highly susceptible to infinitesmal adversarial perturbations. In this paper, we identify an overparameterized linear ensemble, that uses the "lifted" Fourier feature map, that demonstrates both of these behaviors. The input is one-dimensional, and the adversary is only allowed to perturb these inputs and not the non-linear features directly. We find that the learned model is susceptible to adversaries in an intermediate regime where classification generalizes but regression does not. Notably, the susceptibility arises despite the absence of model mis-specification or label noise, which are commonly cited reasons for adversarial-susceptibility. These results are extended theoretically to a random-Fourier-sum setup that exhibits double-descent behavior. In both feature-setups, the adversarial vulnerability arises because of a phenomenon we term spatial localization: the predictions of the learned model are markedly more sensitive in the vicinity of training points than elsewhere. This sensitivity is a consequence of feature lifting and is reminiscent of Gibb's and Runge's phenomena from signal processing and functional analysis. Despite the adversarial susceptibility, we find that classification with these features can be easier than the more commonly studied "independent feature" models.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 39 of its 51 references that are in the map. First posted on arXiv 27 Sep 2021.
Builds on
39 of 51 references.
References · 39
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 953
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
- 2018On Lazy Training in Differentiable Programmingcited by 675
- 2019Benign Overfitting in Linear Regressioncited by 549
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
- 2020Underspecification Presents Challenges for Credibility in Modern Machine Learningcited by 496
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 342
- 2018Adversarially Robust Generalization Requires More Datacited by 318
- 2019Two models of double descent for weak featurescited by 195
27 more
- 2018To understand deep learning we need to understand kernel learningcited by 187
- 2021A Universal Law of Robustness via Isoperimetrycited by 151
- 2020When Do Neural Networks Outperform Kernel Methods?cited by 150
- 2020Understanding and Mitigating the Tradeoff Between Robustness and Accuracycited by 149
- 2018Rademacher Complexity for Adversarially Robust Generalizationcited by 132
- 2019Harmless interpolation of noisy data in regressioncited by 121
- 2019Adversarial Examples Are a Natural Consequence of Test Error in Noisecited by 114
- 2018Are adversarial examples inevitable?cited by 113
- 2018Overfitting or perfect fitting? Risk bounds for classification and regression rules that interpolatecited by 99
- 2020Classification vs regression in overparameterized regimes: Does the loss function matter?cited by 97
- 2016Robustness of classifiers: from adversarial to random noisecited by 88
- 2020Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regimecited by 81
- 2018Adversarial vulnerability for any classifiercited by 78
- 2018The jamming transition as a paradigm to understand the loss landscape of deep neural networkscited by 62
- 2020A law of robustness for two-layers neural networkscited by 55
- 2020Precise Statistical Analysis of Classification Accuracies for Adversarial Trainingcited by 50
- 2021Risk Bounds for Over-parameterized Maximum Margin Classification on Sub-Gaussian Mixturescited by 49
- 2018The Curse of Concentration in Robust Learning: Evasion and Poisoning Attacks from Concentration of Measurecited by 46
- 2015Explaining the Success of AdaBoost and Random Forests as Interpolating Classifierscited by 45
- 2018Consistency of Interpolation with Laplace Kernels is a High-Dimensional Phenomenoncited by 44
- 2019Adversarial Robustness May Be at Odds With Simplicitycited by 39
- 2019More Data Can Hurt for Linear Regression: Sample-wise Double Descentcited by 37
- 2020On the proliferation of support vectors in high dimensionscited by 32
- 2021Properties of the After Kernelcited by 27
- 2020Failures of model-dependent generalization bounds for least-norm interpolationcited by 26
- 2019Understanding overfitting peaks in generalization error: Analytical risk curves for l2 and l1 penalized interpolationcited by 23
- 2019Training Neural Networks as Learning Data-adaptive Kernels: Provable Representation and Approximation Benefitscited by 13
Built on by
Citing papers per year: 2026: 1.
1 paper.