The Geometry of Over-parameterized Regression and Adversarial Perturbations
Not on the map. Why?
Abstract (arXiv)
Classical regression has a simple geometric description in terms of a projection of the training labels onto the column space of the design matrix. However, for over-parameterized models -- where the number of fit parameters is large enough to perfectly fit the training data -- this picture becomes uninformative. Here, we present an alternative geometric interpretation of regression that applies to both under- and over-parameterized models. Unlike the classical picture which takes place in the space of training labels, our new picture resides in the space of input features. This new feature-based perspective provides a natural geometric interpretation of the double-descent phenomenon in the context of bias and variance, explaining why it can occur even in the absence of label noise. Furthermore, we show that adversarial perturbations -- small perturbations to the input features that result in large changes in label values -- are a generic feature of biased models, arising from the underlying geometry. We demonstrate these ideas by analyzing three minimal models for over-parameterized linear least squares regression: without basis functions (input features equal model features) and with linear or nonlinear basis functions (two-layer neural networks with linear or nonlinear activation functions, respectively).
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 30 of its 36 references that are in the map. First posted on arXiv 25 Mar 2021.
Builds on
30 of 36 references.
References · 30
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
- 2019Benign Overfitting in Linear Regressioncited by 544
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
- 2017High-dimensional dynamics of generalization error in neural networkscited by 238
- 2019Two models of double descent for weak featurescited by 194
- 2018Just Interpolate: Kernel "Ridgeless" Regression Can Generalizecited by 190
- 2020Generalisation error in learning with random features and the hidden manifold modelcited by 126
- 2019Harmless interpolation of noisy data in regressioncited by 121
18 more
- 2017Optimal Errors and Phase Transitions in High-Dimensional Generalized Linear Modelscited by 115
- 2020Rethinking Bias-Variance Trade-off for Generalization of Neural Networkscited by 107
- 2020Double Trouble in Double Descent : Bias and Variance(s) in the Lazy Regimecited by 95
- 2018An analytic theory of generalization dynamics and transfer learning in deep linear networkscited by 84
- 2019A Model of Double Descent for High-dimensional Binary Linear Classificationcited by 81
- 2020Understanding Double Descent Requires a Fine-Grained Bias-Variance Decompositioncited by 75
- 2020A Random Matrix Analysis of Random Fourier Features: Beyond the Gaussian Kernel, a Precise Phase Transition, and the Corresponding Double Descentcited by 69
- 2020Triple descent and the two kinds of overfitting: Where & why do they appear?cited by 64
- 2020Implicit Regularization of Random Feature Modelscited by 54
- 2020A Brief Prehistory of Double Descentcited by 44
- 2019More Data Can Hurt for Linear Regression: Sample-wise Double Descentcited by 37
- 2019Exact expressions for double descent and implicit regularization via surrogate random designcited by 35
- 2020Analytic Study of Double Descent in Binary Classification: The Impact of Losscited by 28
- 2020What causes the test error? Going beyond bias-variance via ANOVAcited by 28
- 2020Memorizing without overfitting: Bias, variance, and interpolation in over-parameterized modelscited by 26
- 2019Understanding overfitting peaks in generalization error: Analytical risk curves for l2 and l1 penalized interpolationcited by 23
- 2020Benign Overfitting and Noisy Featurescited by 18
- 2019A New Look at an Old Problem: A Universal Learning Approach to Linear Regressioncited by 11
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 1.
4 papers.
- 2023Double Descent Demystified: Identifying, Interpreting & Ablating the Sources of a Deep Learning Puzzlecited by 36
- 2024Towards an Improved Understanding and Utilization of Maximum Manifold Capacity Representationscited by 8
- 2025Correlating and Predicting Human Evaluations of Language Models from Natural Language Processing Benchmarkscited by 3
- 2024No Free Lunch From Random Feature Ensembles: Scaling Laws and Near-Optimality Conditionscited by 1
- 2025Correlating and Predicting Human Evaluations of Language Models from Natural Language Processing Benchmarks24 Feb 2025
- 2024No Free Lunch From Random Feature Ensembles: Scaling Laws and Near-Optimality Conditions6 Dec 2024
- 2024Towards an Improved Understanding and Utilization of Maximum Manifold Capacity Representations13 Jun 2024
- 2023Double Descent Demystified: Identifying, Interpreting & Ablating the Sources of a Deep Learning Puzzle24 Mar 2023