Learning Curves for Deep Neural Networks: A Gaussian Field Theory Perspective
Not on the map. Why?
Abstract (arXiv)
In the past decade, deep neural networks (DNNs) came to the fore as the leading machine learning algorithms for a variety of tasks. Their raise was founded on market needs and engineering craftsmanship, the latter based more on trial and error than on theory. While still far behind the application forefront, the theoretical study of DNNs has recently made important advancements in analyzing the highly over-parameterized regime where some exact results have been obtained. Leveraging these ideas and adopting a more physics-like approach, here we construct a versatile field-theory formalism for supervised deep learning, involving renormalization group, Feynman diagrams and replicas. In particular we show that our approach leads to highly accurate predictions of learning curves of truly deep DNNs trained on polynomial regression tasks and that these predictions can be used for efficient hyper-parameter optimization. In addition, they explain how DNNs generalize well despite being highly over-parameterized, this due to an entropic bias to simple functions which, for the case of fully-connected DNNs with data sampled on the hypersphere, are low order polynomials in the input vector. Being a complex interacting system of artificial neurons, we believe that such tools and methodologies borrowed from condensed matter physics would prove essential for obtaining an accurate quantitative understanding of deep learning.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jun 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2020: 1; 2021: 5; 2022: 2; 2023: 0; 2024: 0; 2025: 3.
11 papers.
- 2021Explaining Neural Scaling Lawscited by 353
- 2020Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networkscited by 166
- 2022Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functionscited by 68
- 2021Separation of Scales and a Thermodynamic Description of Feature Learning in Some CNNscited by 53
- 2021A self consistent theory of Gaussian Processes captures feature learning effects in finite CNNscited by 33
- 2021Symmetry-via-Duality: Invariant Neural Network Densities from Parameter-Space Correlatorscited by 28
- 2021A Theoretical-Empirical Approach to Estimating Sample Complexity of DNNscited by 6
- 2025Mitigating the Curse of Detail: Scaling Arguments for Feature Learning and Sample Complexitycited by 4
- 2025Characterising the Inductive Biases of Neural Networks on Boolean Datacited by 1
- 2025Feature learning is decoupled from generalization in high capacity neural networkscited by 1
- 2022Complexity from Adaptive-Symmetries Breaking: Global Minima in the Statistical Mechanics of Deep Neural Networkscited by 0
- 2025Mitigating the Curse of Detail: Scaling Arguments for Feature Learning and Sample Complexity3 Dec 2025
- 2025Feature learning is decoupled from generalization in high capacity neural networks25 Jul 2025
- 2025Characterising the Inductive Biases of Neural Networks on Boolean Data29 May 2025
- 2022Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions22 Nov 2022
- 2022Complexity from Adaptive-Symmetries Breaking: Global Minima in the Statistical Mechanics of Deep Neural Networks3 Jan 2022
- 2021Separation of Scales and a Thermodynamic Description of Feature Learning in Some CNNs31 Dec 2021
- 2021A self consistent theory of Gaussian Processes captures feature learning effects in finite CNNs8 Jun 2021
- 2021Symmetry-via-Duality: Invariant Neural Network Densities from Parameter-Space Correlators1 Jun 2021
- 2021A Theoretical-Empirical Approach to Estimating Sample Complexity of DNNs5 May 2021
- 2021Explaining Neural Scaling Laws12 Feb 2021
- 2020Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networks23 Jun 2020