Neural Quadratic Forms: A Unified Minimal Model for Sudden Learning and Scaling Laws
Not on the map. Why?
Abstract (arXiv)
Neural networks trained by gradient descent on a smooth cost function can nevertheless learn in steps: the cost holds on long plateaus and then drops abruptly. Meanwhile, training losses instead follow smooth power laws. Variants of both behaviors occur in architectures with very different microscopic structures, which is the signature of a few relevant collective variables. We show that a symmetry fixes what those variables are: a network layer is a sum over interchangeable units, so relabeling the units leaves it unchanged; given smoothness and the condition that a unit's gradient vanish at the origin, symmetry then enforces a universal leading form for the expansion about the near-zero weights present at the start of training, the quadratic Tr[WWtopA(x)], in which every architectural detail is confined to a single ``structure matrix" A(x) that we compute for each architecture. Perceptrons, attention layers, mixtures of experts, and convolutions become one model at different A. Its training dynamics then close on the ``order parameter" M=WWtop and, whenever the data matrices share an eigenbasis, reduce to a Lotka--Volterra equation whose modes switch on one after another. The smaller the initial weights, the further apart the switch-on times, and the plateaus appear as a singular limit of a smooth flow; when many modes are unresolved the same events merge into a power law in training time whose exponent the theory predicts. We confirm both numerically across training methods and architectures.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 8 of its 80 references that are in the map. First posted on arXiv 13 Aug 2026.
Builds on
8 of 80 references.
References · 8
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018Gradient Descent Happens in a Tiny Subspacecited by 217
- 2022A Solvable Model of Neural Scaling Lawscited by 116
- 2014word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding methodcited by 112
- 2025The Universal Weight Subspace Hypothesiscited by 24
- 2023Mechanism of feature learning in convolutional neural networkscited by 17
- 2026A Defense of the Quadratic Modelcited by 14
- 2025Parameter Symmetry Potentially Unifies Deep Learning Theorycited by 12
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2024Symmetries in Overparametrized Neural Networks: A Mean-Field View
- 2024Collective variables of neural networks: empirical time evolution and scaling laws
- 2026Representation Gap: Explaining the Unreasonable Effectiveness of Neural Networks from a Geometric Perspective
- 2023Phase transitions in the mini-batch size for sparse and dense two-layer neural networks
- 2026The Model Shape Behind Scaling Laws: A Gradient Superposition Perspective
- 2026High-Dimensional Analysis of Gradient Flow for Extensive-Width Quadratic Neural Networks
- 2023An effective theory of collective deep learning
- 2026Conservation Laws for Modern Neural Architectures