Double-Descent Curves in Neural Networks: A New Perspective Using Gaussian Processes
Ouns El Harzli, Bernardo Cuenca Grau, Guillermo Valle Pérez, Ard A. Louis
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers4
- An exactly solvable model for emergence and scaling laws in the multitask sparse parity problemYoonsoo Nam, Nayara Fonseca, Seok Hyeong Lee, Chris Mingard et al.NeurIPS 2024 · 20 citations
- Generalization Through the Lens of Leave-One-Out ErrorGregor Bachmann, Thomas Hofmann, Aurélien LucchiICLR 2022 · 9 citations
- Decoupling Dynamical Richness from Representation Learning: Towards Practical MeasurementYoonsoo Nam, Nayara Fonseca, Seok Hyeong Lee, Chris Mingard et al.ICLR 2026 · 2 citations
- Bayesian Treatment of the Spectrum of the Empirical Kernel in (Sub)Linear-Width Neural NetworksOuns El Harzli, Bernardo Cuenca GrauICLR 2025
Builds on13
- Deep Double Descent: Where Bigger Models and More Data HurtPreetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang et al.ICLR 2020 · 1,108 citations
- Bayesian Deep Learning and a Probabilistic Perspective of GeneralizationAndrew Gordon Wilson, Pavel IzmailovNeurIPS 2020 · 845 citations
- Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural NetworksBlake Bordelon, Abdulkadir Canatar, Cengiz PehlevanICML 2020 · 245 citations
- Finite Versus Infinite Neural Networks: an Empirical StudyJaehoon Lee, Samuel S. Schoenholz, Jeffrey Pennington, Ben Adlam et al.NeurIPS 2020 · 245 citations
- When Do Neural Networks Outperform Kernel Methods?Behrooz Ghorbani, Song Mei, Theodor Misiakiewicz, Andrea MontanariNeurIPS 2020 · 217 citations
Related papers
- The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of GeneralizationBen Adlam, Jeffrey PenningtonICML 2020 · 133 citations
- Least Squares Regression Can Exhibit Under-Parameterized Double DescentXinyue Li, Rishi SonthaliaNeurIPS 2024 · 5 citations
- On the Role of Optimization in Double Descent: A Least Squares StudyIlja Kuzborskij, Csaba Szepesvári, Omar Rivasplata, Amal Rannen-Triki et al.NeurIPS 2021 · 12 citations
- Exact expressions for double descent and implicit regularization via surrogate random designMichal Derezinski, Feynman T. Liang, Michael W. MahoneyNeurIPS 2020 · 81 citations
- Model, sample, and epoch-wise descents: exact solution of gradient flow in the random feature modelAntoine Bodin, Nicolas MacrisNeurIPS 2021 · 19 citations
