Skip to content

Double descent is the principle of least action

Sep 2026 · 0 citations · 38 references
Computer Science Mathematics Physics

Abstract

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 $L^2$ 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.

View source

Similar papers

Preprint Sep 2026

Physics of Information Geometry - Part I: Principle of Least Action on the Probability Simplex

We develop a least-action framework for describing how a probability distribution can evolve from an equilibrium state to a prescribed nonequilibrium state under constrained incremental changes. Taking a Gibbs distribution as the equilibrium reference, the framework gives a direct physical meaning to the geometry of th...

C. Koksal, Deniz Sargun · 1 citation
#artificial intelligence Preprint Sep 2026

A Function-Space Approach to the Statistical Mechanics of Learning Dynamics

In the kernel regime, neural-network learning inherits its preferences from a frozen spectrum. During feature learning, this spectrum evolves, yet networks retain systematic biases toward simple, smooth directions. We develop a function-space statistical framework explaining the origin of these preferences, treating fu...

Yizhou Zhang, Wei-Chen Wu, Lun Du et al. · 0 citations
Open access Sep 2026

Complexity drives the symmetry breaking of temperature fluctuations

Frequently, nonextensive systems are described through $q$-exponential functions, where the $q$-parameter determines how far a system is from equilibrium. In this work, we study systems constrained to $q-1\ll1$ to describe systems near thermal equilibrium, and derive the probability density function and temperature flu...

D. R. Herrera, M. Y. Gallegos Ruiz, A. F. Téllez et al. · 0 citations
#machine learning Preprint Sep 2026

Quenched Ensemble Sampling

Some of the sharpest challenges in sampling from the energy functions of physical systems arise at phase transitions, where the density of states changes abruptly and many sampling algorithms stall. Nested sampling is a particle method that traverses the density of states under a hard energy constraint and is known to...

D. Yallup · 0 citations
Preprint Aug 2026

On the relaxation problem in statistical mechanics

We reformulate the relaxation problem in statistical mechanics by making explicit what are the \emph{operational} objects subject to relaxation: the local time statistics of the recorded signal $Z(t)$. These local time statistics are simply the estimated histograms of observations $\{Z(t_i)\}_{i=1}^M$ performed at unif...

Giuseppe Del Vecchio Del Vecchio · 0 citations
#machine learning Preprint Sep 2026

A Theoretical Analysis of Generalization Dynamics in Neural Networks under Gradient Descent with Weight Decay

A broad class of neural networks trained under the $\ell^2$ loss by gradient descent with weight decay with weight decay is studied, and the convergence of GD to a neighbourhood of the global minimizers of the empirical loss is proved.

Yu-Qing Wang, I. Kevrekidis, Mikhail Belkin · 1 citation

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.