mlsanityData to 14 Oct 2026

Phenomenology of Double Descent in Finite-Width Neural Networks

arXiv 2203.07337 ↗First posted 14 Mar 2022stat.ML cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

`Double descent' delineates the generalization behaviour of models depending on the regime they belong to: under- or over-parameterized. The current theoretical understanding behind the occurrence of this phenomenon is primarily based on linear and kernel regression models -- with informal parallels to neural networks via the Neural Tangent Kernel. Therefore such analyses do not adequately capture the mechanisms behind double descent in finite-width neural networks, as well as, disregard crucial components -- such as the choice of the loss function. We address these shortcomings by leveraging influence functions in order to derive suitable expressions of the population loss and its lower bound, while imposing minimal assumptions on the form of the parametric model. Our derived bounds bear an intimate connection with the spectrum of the Hessian at the optimum, and importantly, exhibit a double descent behaviour at the interpolation threshold. Building on our analysis, we further investigate how the loss function affects double descent -- and thus uncover interesting properties of neural networks and their Hessian spectra near the interpolation threshold.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 23 of its 46 references that are in the map. First posted on arXiv 14 Mar 2022.

Builds on

23 of 46 references.

References · 23

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  2. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  3. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
  4. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  5. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
  6. 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
  7. 2019Benign Overfitting in Linear Regressioncited by 549
  8. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
  9. 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
  10. 2020Influence Functions in Deep Learning Are Fragilecited by 252
  11. 2017High-dimensional dynamics of generalization error in neural networkscited by 241
  12. 2016Eigenvalues of the Hessian in Deep Learning: Singularity and Beyondcited by 159
11 more
  1. 2019Harmless interpolation of noisy data in regressioncited by 121
  2. 2020Optimal Regularization Can Mitigate Double Descentcited by 109
  3. 2020Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networkscited by 87
  4. 2019Scaling description of generalization with number of parameters in deep learningcited by 83
  5. 2021Analytic Insights into Structure and Rank of Neural Network Hessian Mapscited by 52
  6. 2020A Brief Prehistory of Double Descentcited by 44
  7. 2019More Data Can Hurt for Linear Regression: Sample-wise Double Descentcited by 37
  8. 2020Scaling Down Deep Learning with MNIST-1Dcited by 25
  9. 2015From Averaging to Acceleration, There is Only a Step-sizecited by 24
  10. 2017Exponential convergence of testing error for stochastic gradient methodscited by 13
  11. 2021On the Role of Optimization in Double Descent: A Least Squares Studycited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 2; 2023: 3; 2024: 3; 2025: 1; 2026: 3.

12 papers.