mlsanityData to 7 Oct 2026

Understanding the Double Descent Phenomenon in Deep Learning

arXiv 2403.10459 ↗First posted 15 Mar 2024cs.LG cs.CV stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

Combining empirical risk minimization with capacity control is a classical strategy in machine learning when trying to control the generalization gap and avoid overfitting, as the model class capacity gets larger. Yet, in modern deep learning practice, very large over-parameterized models (e.g. neural networks) are optimized to fit perfectly the training data and still obtain great generalization performance. Past the interpolation point, increasing model complexity seems to actually lower the test error. In this tutorial, we explain the concept of double descent and its mechanisms. The first section sets the classical statistical learning framework and introduces the double descent phenomenon. By looking at a number of examples, section 2 introduces inductive biases that appear to have a key role in double descent by selecting, among the multiple interpolating solutions, a smooth empirical risk minimizer. Finally, section 3 explores the double descent with two linear models, and gives other points of view from recent related works.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 13 of its 23 references that are in the map. First posted on arXiv 15 Mar 2024.

Builds on

13 of 23 references.

References · 13

  1. 2018Relational inductive biases, deep learning, and graph networkscited by 1,341
  2. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  3. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
  4. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
  5. 2017Implicit Regularization in Matrix Factorizationcited by 318
  6. 2018On the Optimization of Deep Networks: Implicit Acceleration by Overparameterizationcited by 280
  7. 2019Two models of double descent for weak featurescited by 194
  8. 2019Towards moderate overparameterization: global convergence guarantees for training shallow neural networkscited by 176
  9. 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 117
  10. 2016An Analysis of Deep Neural Network Models for Practical Applicationscited by 114
  11. 2019Scaling description of generalization with number of parameters in deep learningcited by 83
  12. 2019The Implicit Bias of Depth: How Incremental Learning Drives Generalizationcited by 64
1 more
  1. 2020Multiple Descent: Design Your Own Generalization Curvecited by 44

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 2.

3 papers.