Double-descent curves in neural networks: a new perspective using Gaussian processes
Not on the map. Why?
Abstract (arXiv)
Double-descent curves in neural networks describe the phenomenon that the generalisation error initially descends with increasing parameters, then grows after reaching an optimal number of parameters which is less than the number of data points, but then descends again in the overparameterized regime. In this paper, we use techniques from random matrix theory to characterize the spectral distribution of the empirical feature covariance matrix as a width-dependent perturbation of the spectrum of the neural network Gaussian process (NNGP) kernel, thus establishing a novel connection between the NNGP literature and the random matrix theory literature in the context of neural networks. Our analytical expression allows us to study the generalisation behavior of the corresponding kernel and GP regression, and provides a new interpretation of the double-descent phenomenon, namely as governed by the discrepancy between the width-dependent empirical kernel and the width-independent NNGP kernel.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 45 of its 86 references that are in the map. First posted on arXiv 14 Feb 2021.
Builds on
45 of 86 references.
References · 45
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2014Deep Learning in Neural Networks: An Overviewcited by 765
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
- 2020Bayesian Deep Learning and a Probabilistic Perspective of Generalizationcited by 480
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
- 2014Deep Speech: Scaling up end-to-end speech recognitioncited by 354
- 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 314
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
33 more
- 2017High-dimensional dynamics of generalization error in neural networkscited by 238
- 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
- 2019Two models of double descent for weak featurescited by 194
- 2018Deep learning generalizes because the parameter-function map is biased towards simple functionscited by 180
- 2019Towards Understanding the Spectral Bias of Deep Learningcited by 173
- 2020Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networkscited by 166
- 2018Bayesian Deep Convolutional Networks with Many Channels are Gaussian Processescited by 164
- 2020Finite Versus Infinite Neural Networks: an Empirical Studycited by 156
- 2020When Do Neural Networks Outperform Kernel Methods?cited by 150
- 2019Tensor Programs I: Wide Feedforward or Recurrent Neural Networks of Any Architecture are Gaussian Processescited by 148
- 2016Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivitycited by 138
- 2018Deep Convolutional Networks as shallow Gaussian Processescited by 137
- 2020Generalisation error in learning with random features and the hidden manifold modelcited by 126
- 2020The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalizationcited by 101
- 2020Double Trouble in Double Descent : Bias and Variance(s) in the Lazy Regimecited by 95
- 2019Scaling description of generalization with number of parameters in deep learningcited by 83
- 2017A Random Matrix Approach to Neural Networkscited by 80
- 2020Spectra of the Conjugate Kernel and Neural Tangent Kernel for linear-width neural networkscited by 76
- 2020Understanding Double Descent Requires a Fine-Grained Bias-Variance Decompositioncited by 75
- 2020Statistical Mechanics of Deep Linear Neural Networks: The Back-Propagating Kernel Renormalizationcited by 71
- 2020A Random Matrix Analysis of Random Fourier Features: Beyond the Gaussian Kernel, a Precise Phase Transition, and the Corresponding Double Descentcited by 69
- 2017SGD Learns the Conjugate Kernel Class of the Networkcited by 54
- 2020Kernel Alignment Risk Estimator: Risk Prediction from Training Datacited by 54
- 2020Is SGD a Bayesian sampler? Well, almostcited by 50
- 2020Tight Nonparametric Convergence Rates for Stochastic Gradient Descent under the Noiseless Linear Modelcited by 39
- 2020Kernel regression in high dimensions: Refined analysis beyond double descentcited by 39
- 2020Generalization bounds for deep learningcited by 38
- 2020Generalization Error of Generalized Linear Models in High Dimensionscited by 25
- 2019Efficiently escaping saddle points on manifoldscited by 24
- 2019Neural networks are a priori biased towards Boolean functions with low entropycited by 24
- 2020Perspective: A Phase Diagram for Deep Learning unifying Jamming, Feature Learning and Lazy Trainingcited by 11
- 2020Asymptotic errors for convex penalized linear regression beyond Gaussian matricescited by 6
- 2019On the effect of the activation function on the distribution of hidden nodes in a deep networkcited by 1
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 3.
5 papers.
- 2023Deep neural networks have an inbuilt Occam's razorcited by 28
- 2022Generalization Through The Lens Of Leave-One-Out Errorcited by 10
- 2024A direct proof of a unified law of robustness for Bregman divergence lossescited by 4
- 2024Exploiting the equivalence between quantum neural networks and perceptronscited by 3
- 2024Decoupling Dynamical Richness from Representation Learning: Towards Practical Measurementcited by 2
- 2024Decoupling Dynamical Richness from Representation Learning: Towards Practical Measurement5 Oct 2024
- 2024Exploiting the equivalence between quantum neural networks and perceptrons5 Jul 2024
- 2024A direct proof of a unified law of robustness for Bregman divergence losses26 May 2024
- 2023Deep neural networks have an inbuilt Occam's razor13 Apr 2023
- 2022Generalization Through The Lens Of Leave-One-Out Error7 Mar 2022