Data-driven Prediction of General Hamiltonian Dynamics via Learning Exactly-Symplectic Maps
arXiv:2103.05632
Abstract
We consider the learning and prediction of nonlinear time series generated by a latent symplectic map. A special case is (not necessarily separable) Hamiltonian systems, whose solution flows give such symplectic maps. For this special case, both generic approaches based on learning the vector field of the latent ODE and specialized approaches based on learning the Hamiltonian that generates the vector field exist. Our method, however, is different as it does not rely on the vector field nor assume its existence; instead, it directly learns the symplectic evolution map in discrete time. Moreover, we do so by representing the symplectic map via a generating function, which we approximate by a neural network (hence the name GFNN). This way, our approximation of the evolution map is always \emph{exactly} symplectic. This additional geometric structure allows the local prediction error at each step to accumulate in a controlled fashion, and we will prove, under reasonable assumptions, that the global prediction error grows at most \emph{linearly} with long prediction time, which significantly improves an otherwise exponential growth. In addition, as a map-based and thus purely data-driven method, GFNN avoids two additional sources of inaccuracies common in vector-field based approaches, namely the error in approximating the vector field by finite difference of the data, and the error in numerical integration of the vector field for making predictions. Numerical experiments further demonstrate our claims.
arXiv comment17 pages, 7 figures. ICML 2021
References in corpus (13)
- Discovering governing equations from data: Sparse identification of nonlinear dynamical systems
- Hidden Physics Models: Machine Learning of Nonlinear Partial Differential Equations
- Hamiltonian Neural Networks
- Nonlinear time-series analysis revisited
- Data Driven Governing Equations Approximation Using Deep Neural Networks
- Deep learning of dynamics and signal-noise decomposition with time-stepping constraints
- Multistep Neural Networks for Data-driven Discovery of Nonlinear Dynamical Systems
- Symplectic ODE-Net: Learning Hamiltonian Dynamics with Control
- Nonparametric inference of interaction laws in systems of agents from trajectory data
- Explicit symplectic approximation of nonseparable Hamiltonians: algorithm and long time performance
- Uncovering Circumbinary Planetary Architectural Properties from Selection Biases
- Hamiltonian Generative Networks
- Tensorized Transformer for Dynamical Systems Modeling
Cited by in corpus (5)
- Symplectic Learning for Hamiltonian Neural Networks
- Structure-preserving Sparse Identification of Nonlinear Dynamics for Data-driven Modeling
- A hybrid approach for solving the gravitational N-body problem with Artificial Neural Networks
- Learning Large-Time-Step Molecular Dynamics with Graph Neural Networks
- Reversible and irreversible bracket-based dynamics for deep graph neural networks