Double descent is the principle of least action
Not on the map. Why?
Abstract (arXiv)
The test error of a model plotted against its number of parameters d falls, peaks when the model can just fit the training data, and falls again, exhibiting the double descent phenomenon. We explain the phenomenon with statistical mechanics. The training trajectory of a stochastic gradient-based method is a particle wandering over the energy landscape of the training loss at an induced temperature T, and a run that has equilibrated visits every parameter vector of a given training loss equally often, the fundamental postulate of statistical mechanics, with probability given by the Boltzmann distribution. Because training starts at an initial point and has only finite time to diffuse, it carries an effective weight decay, which makes every parameter a quadratic degree of freedom. The equipartition theorem then distributes the energy among the d degrees of freedom in shares of T/2, so at a fixed training loss adding parameters lowers the temperature and drives the Boltzmann distribution toward the stationary path. Finally, adding parameters can only lower the L2 norm of the stationary path, so a solution sampled at fixed loss is less likely to be large with increasing d, effectively increasing weight regularization.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 38 references that are in the map. First posted on arXiv 16 Sep 2026.
Builds on
15 of 38 references.
References · 15
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
- 2019Benign Overfitting in Linear Regressioncited by 549
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
- 2019Scaling description of generalization with number of parameters in deep learningcited by 83
- 2024Exponential Moving Average of Weights in Deep Learning: Dynamics and Benefitscited by 71
- 2018A Continuous-Time View of Early Stopping for Least Squarescited by 69
3 more
- 2018A jamming transition from under- to over-parametrization affects loss landscape and generalizationcited by 67
- 2025An Introduction to Flow Matching and Diffusion Modelscited by 35
- 2026Broken Ergodicity and the Violation of the Fluctuation-Dissipation Theorem Lead to Generalization Beyond Overfitting in Machine Learningcited by 1
Built on by
Not cited yet.