Edge of chaos as a guiding principle for modern neural network training
Not on the map. Why?
Abstract (arXiv)
The success of deep neural networks in real-world problems has prompted many attempts to explain their training dynamics and generalization performance, but more guiding principles for the training of neural networks are still needed. Motivated by the edge of chaos principle behind the optimal performance of neural networks, we study the role of various hyperparameters in modern neural network training algorithms in terms of the order-chaos phase diagram. In particular, we study a fully analytical feedforward neural network trained on the widely adopted Fashion-MNIST dataset, and study the dynamics associated with the hyperparameters in back-propagation during the training process. We find that for the basic algorithm of stochastic gradient descent with momentum, in the range around the commonly used hyperparameter values, clear scaling relations are present with respect to the training time during the ordered phase in the phase diagram, and the model's optimal generalization power at the edge of chaos is similar across different training parameter combinations. In the chaotic phase, the same scaling no longer exists. The scaling allows us to choose the training parameters to achieve faster training without sacrificing performance. In addition, we find that the commonly used model regularization method - weight decay - effectively pushes the model towards the ordered phase to achieve better performance. Leveraging on this fact and the scaling relations in the other hyperparameters, we derived a principled guideline for hyperparameter determination, such that the model can achieve optimal performance by saturating it at the edge of chaos. Demonstrated on this simple neural network model and training algorithm, our work improves the understanding of neural network training dynamics, and can potentially be extended to guiding principles of more complex model architectures and algorithms.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 18 of its 45 references that are in the map. First posted on arXiv 20 Jul 2021.
Builds on
18 of 45 references.
References · 18
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 494
- 2014The Loss Surfaces of Multilayer Networkscited by 278
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
- 2017High-dimensional dynamics of generalization error in neural networkscited by 238
- 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 141
- 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 134
- 2016Robust Large Margin Deep Neural Networkscited by 117
- 2018Three Mechanisms of Weight Decay Regularizationcited by 112
- 2019Traditional and Heavy-Tailed Self Regularization in Neural Network Modelscited by 104
- 2019Generalization Guarantees for Neural Networks via Harnessing the Low-rank Structure of the Jacobiancited by 67
- 2018The jamming transition as a paradigm to understand the loss landscape of deep neural networkscited by 61
6 more
- 2019Time Matters in Regularizing Deep Networks: Weight Decay and Data Augmentation Affect Early Learning Dynamics, Matter Little Near Convergencecited by 54
- 2018Comparing Dynamics: Deep Neural Networks versus Glassy Systemscited by 42
- 2015Transition to chaos in random neuronal networkscited by 11
- 2019Optimal Machine Intelligence at the Edge of Chaoscited by 7
- 2019Optimal short-term memory before the edge of chaos in driven random recurrent networkscited by 6
- 2018Interpreting Deep Learning: The Machine Learning Rorschach Test?cited by 1
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 2; 2024: 0; 2025: 5.
10 papers.
- 2022Global Convergence of SGD On Two Layer Neural Netscited by 5
- 2021Free Probability for predicting the performance of feed-forward fully connected neural networkscited by 3
- 2023Global Convergence of SGD For Logistic Loss on Two Layer Neural Netscited by 3
- 2025Adversarial Data Augmentation for Single Domain Generalization via Lyapunov Exponent-Guided Optimizationcited by 1
- 2025A Spin Glass Characterization of Neural Networkscited by 1
- 2025Toward a Physics of Deep Learning and Brainscited by 1
- 2022Complexity from Adaptive-Symmetries Breaking: Global Minima in the Statistical Mechanics of Deep Neural Networkscited by 0
- 2023To prune or not to prune : A chaos-causality approach to principled pruning of dense neural networkscited by 0
- 2025Lyapunov Learning at the Onset of Chaoscited by 0
- 2025Complexity-Regularized Proximal Policy Optimizationcited by 0
- 2025Toward a Physics of Deep Learning and Brains26 Sep 2025
- 2025Complexity-Regularized Proximal Policy Optimization24 Sep 2025
- 2025A Spin Glass Characterization of Neural Networks10 Aug 2025
- 2025Adversarial Data Augmentation for Single Domain Generalization via Lyapunov Exponent-Guided Optimization6 Jul 2025
- 2025Lyapunov Learning at the Onset of Chaos15 Jun 2025
- 2023Global Convergence of SGD For Logistic Loss on Two Layer Neural Nets17 Sep 2023
- 2023To prune or not to prune : A chaos-causality approach to principled pruning of dense neural networks19 Aug 2023
- 2022Global Convergence of SGD On Two Layer Neural Nets20 Oct 2022
- 2022Complexity from Adaptive-Symmetries Breaking: Global Minima in the Statistical Mechanics of Deep Neural Networks3 Jan 2022
- 2021Free Probability for predicting the performance of feed-forward fully connected neural networks1 Nov 2021