mlsanityData to 7 Oct 2026

KAM Theory Meets Statistical Learning Theory: Hamiltonian Neural Networks with Non-Zero Training Loss

arXiv 2102.11923 ↗First posted 22 Feb 2021math.DS cs.LG math-phcited by 2

Not on the map. Why?

Abstract (arXiv)

Many physical phenomena are described by Hamiltonian mechanics using an energy function (the Hamiltonian). Recently, the Hamiltonian neural network, which approximates the Hamiltonian as a neural network, and its extensions have attracted much attention. This is a very powerful method, but its use in theoretical studies remains limited. In this study, by combining the statistical learning theory and Kolmogorov-Arnold-Moser (KAM) theory, we provide a theoretical analysis of the behavior of Hamiltonian neural networks when the learning error is not completely zero. A Hamiltonian neural network with non-zero errors can be considered as a perturbation from the true dynamics, and the perturbation theory of the Hamilton equation is widely known as the KAM theory. To apply the KAM theory, we provide a generalization error bound for Hamiltonian neural networks by deriving an estimate of the covering number of the gradient of the multi-layer perceptron, which is the key ingredient of the model. This error bound gives an L^∞ bound on the Hamiltonian that is required in the application of the KAM theory.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 18 of its 40 references that are in the map. First posted on arXiv 22 Feb 2021.

Builds on

18 of 40 references.

References · 18

  1. 2018Neural Ordinary Differential Equationscited by 3,733
  2. 2019Hamiltonian Neural Networkscited by 702
  3. 2020Lagrangian Neural Networkscited by 388
  4. 2020Generalizing Convolutional Neural Networks for Equivariance to Lie Groups on Arbitrary Continuous Datacited by 248
  5. 2019Symplectic ODE-Net: Learning Hamiltonian Dynamics with Controlcited by 183
  6. 2019Symplectic Recurrent Neural Networkscited by 148
  7. 2019Hamiltonian Generative Networkscited by 136
  8. 2019Hamiltonian Graph Networks with ODE Integratorscited by 107
  9. 2020Simplifying Hamiltonian and Lagrangian Neural Networks via Explicit Constraintscited by 102
  10. 2020Coupling-based Invertible Neural Networks Are Universal Diffeomorphism Approximatorscited by 85
  11. 2020Learning Poisson systems and trajectories of autonomous systems via Poisson neural networkscited by 37
  12. 2020Euclideanizing Flows: Diffeomorphic Reduction for Learning Stable Dynamical Systemscited by 32
6 more
  1. 2020Nonseparable Symplectic Neural Networkscited by 31
  2. 2020Sparse Symplectically Integrated Neural Networkscited by 20
  3. 2019Neural Canonical Transformation with Symplectic Flowscited by 16
  4. 2019Learning Symmetries of Classical Integrable Systemscited by 15
  5. 2020Learning Principle of Least Action with Reinforcement Learningcited by 3
  6. 2020Time-Continuous Energy-Conservation Neural Network for Structural Dynamics Analysiscited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 1.

2 papers.