Renormalizable Spectral-Shell Dynamics as the Origin of Neural Scaling Laws
Not on the map. Why?
Abstract (arXiv)
Neural scaling laws and double-descent phenomena suggest that deep-network training obeys a simple macroscopic structure despite highly nonlinear optimization dynamics. We derive such structure directly from gradient descent in function space. For mean-squared error loss, the training error evolves as dot et=-M(t)et with M(t)=Jθ(t)Jθ(t)!*, a time-dependent self-adjoint operator induced by the network Jacobian. Using Kato perturbation theory, we obtain an exact system of coupled modewise ODEs in the instantaneous eigenbasis of M(t). To extract macroscopic behavior, we introduce a logarithmic spectral-shell coarse-graining and track quadratic error energy across shells. Microscopic interactions within each shell cancel identically at the energy level, so shell energies evolve only through dissipation and external inter-shell interactions. We formalize this via a renormalizable shell-dynamics assumption, under which cumulative microscopic effects reduce to a controlled net flux across shell boundaries. Assuming an effective power-law spectral transport in a relevant resolution range, the shell dynamics admits a self-similar solution with a moving resolution frontier and explicit scaling exponents. This framework explains neural scaling laws and double descent, and unifies lazy (NTK-like) training and feature learning as two limits of the same spectral-shell dynamics.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 42 references that are in the map. First posted on arXiv 11 Dec 2025.
Builds on
28 of 42 references.
References · 28
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2022Emergent Abilities of Large Language Modelscited by 2,512
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2018On the Spectral Bias of Neural Networkscited by 1,341
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
- 2020Up or Down? Adaptive Rounding for Post-Training Quantizationcited by 621
- 2020What is the State of Neural Network Pruning?cited by 583
16 more
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 582
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
- 2020Scaling Laws for Autoregressive Generative Modelingcited by 522
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
- 20218-bit Optimizers via Block-wise Quantizationcited by 403
- 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 292
- 2019On the Inductive Bias of Neural Tangent Kernelscited by 177
- 2024A Dynamical Model of Neural Scaling Lawscited by 111
- 2024Scaling Laws for Precisioncited by 95
- 2024How Feature Learning Can Improve Neural Scaling Lawscited by 56
- 2024From Lazy to Rich: Exact Learning Dynamics in Deep Linear Networkscited by 49
- 2023Feature-Learning Networks Are Consistent Across Widths At Realistic Scalescited by 41
- 2024Densing Law of LLMscited by 40
- 2020On the Predictability of Pruning Across Scalescited by 33
- 2022Spectral Evolution and Invariance in Linear-width Neural Networkscited by 30
- 2025A Generalized Spectral Framework to Expain Neural Scaling and Compression Dynamicscited by 3
Built on by
Not cited yet.