mlsanityData to 7 Oct 2026

Theory of learning of high-dimensional controlled non-linear dynamical systems (I): models and methods

arXiv 2606.07247 ↗First posted 5 Jun 2026cond-mat.dis-nn cond-mat.stat-mech stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Neural ordinary differential equations (neural ODEs) have rapidly gained prominence as a powerful and unifying framework for conceptualizing artificial neural networks, elegantly connecting the continuous-time modeling of dynamical systems with the discrete, data-driven paradigm of modern deep learning. Beyond their practical advantages they offer fresh theoretical insights into the training and generalization properties of neural networks. The distinctive feature of this framework is its dual dynamical nature: inference dynamics, which govern the ODE evolution during forward computation, and training dynamics, which control the optimization of model parameters. This makes neural ODEs a particularly well-suited theoretical framework for studying a large variety of settings such as multi-layer neural networks (ResNets for example), autoregressive models (with next-token generation dynamics), generative models, and recurrent neural networks in theoretical neuroscience. In this work, we introduce a theoretically grounded class of models for studying neural ODEs trained via online stochastic gradient descent. We solve the training dynamics of these models via dynamical mean field theory and derive learning curves in the high-dimensional limit.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 55 references that are in the map. First posted on arXiv 5 Jun 2026.

Builds on

24 of 55 references.

References · 24

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018Neural Ordinary Differential Equationscited by 3,733
  3. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  4. 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
  5. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  6. 2020HiPPO: Recurrent Memory with Optimal Polynomial Projectionscited by 600
  7. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
  8. 2022On Neural Differential Equationscited by 264
  9. 2018Trainability and Accuracy of Neural Networks: An Interacting Particle System Approachcited by 105
  10. 2024A Dynamical Model of Neural Scaling Lawscited by 105
  11. 2018A Mean-Field Optimal Control Formulation of Deep Learningcited by 67
  12. 2020Dynamical mean-field theory for stochastic gradient descent in Gaussian mixture classificationcited by 60
12 more
  1. 2020The estimation error of general first order methodscited by 33
  2. 2025Emergence and scaling laws in SGD learning of shallow neural networkscited by 29
  3. 2019Passed & Spurious: Descent Algorithms and Local Minima in Spiked Matrix-Tensor Modelscited by 28
  4. 2021The effective noise of Stochastic Gradient Descentcited by 25
  5. 2018Marvels and Pitfalls of the Langevin Algorithm in Noisy High-dimensional Inferencecited by 24
  6. 2021Stochasticity helps to navigate rough landscapes: comparing gradient-descent-based algorithms in the phase retrieval problemcited by 23
  7. 2025Dynamical Decoupling of Generalization and Overfitting in Large Two-Layer Networkscited by 21
  8. 2024Optimal Protocols for Continual Learning via Statistical Physics and Control Theorycited by 14
  9. 2021Analytical Study of Momentum-Based Acceleration Methods in Paradigmatic High-Dimensional Non-Convex Problemscited by 5
  10. 2023Statistical physics of learning in high-dimensional chaotic systemscited by 3
  11. 2023Stochastic Gradient Descent outperforms Gradient Descent in recovering a high-dimensional signal in a glassy energy landscapecited by 3
  12. 2021Disordered high-dimensional optimal controlcited by 2

Built on by

Not cited yet.