Leveraging chaotic transients in the training of artificial neural networks
Not on the map. Why?
Abstract (arXiv)
Traditional algorithms to optimize artificial neural networks when confronted with a supervised learning task are usually exploitation-type relaxational dynamics such as gradient descent (GD). Here, we explore the dynamics of the neural network trajectory along training for unconventionally large learning rates. We show that for a region of values of the learning rate, the GD optimization shifts away from purely exploitation-like algorithm into a regime of exploration-exploitation balance, as the neural network is still capable of learning but the trajectory shows sensitive dependence on initial conditions --as characterized by positive network maximum Lyapunov exponent--. Interestingly, the characteristic training time required to reach an acceptable accuracy in the test set reaches a minimum precisely in such learning rate region, further suggesting that one can accelerate the training of artificial neural networks by locating at the onset of chaos. Our results --initially illustrated for the MNIST classification task-- qualitatively hold for a range of supervised learning tasks, {learning architectures (including both shallow and deep multilayer perceptrons and convolutional neural networks) and other hyperparameters (different activation functions and weight regularisation),} and showcase the emergent, constructive role of transient chaotic dynamics in the training of artificial neural networks.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 14 of its 50 references that are in the map. First posted on arXiv 10 Jun 2025.
Builds on
14 of 50 references.
References · 14
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
- 2023How Two-Layer Neural Networks Learn, One (Giant) Step at a Timecited by 68
- 2020Stochasticity of Deterministic Gradient Descent: Large Learning Rate for Multiscale Objective Functioncited by 26
- 2023Finite-time Lyapunov exponents of deep neural networkscited by 12
- 2015Transition to chaos in random neuronal networkscited by 11
- 2023An effective theory of collective deep learningcited by 7
- 2024Dynamical stability and chaos in artificial neural network trajectories along trainingcited by 6
- 2021Forgetting leads to chaos in attractor networkscited by 5
- 2022Correlations of network trajectoriescited by 4
- 2024Scalar embedding of temporal network trajectoriescited by 3
- 2024Initialisation and Network Effects in Decentralised Federated Learningcited by 2
- 2024Deep Neural Networks via Complex Network Theory: a Perspectivecited by 2
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.