Learning Deterministic and Stochastic Forced Hamiltonian Systems

arXiv:2608.19688v1 Announce Type: cross Abstract: We develop a geometric framework for learning deterministic and stochastic forced Hamiltonian systems with neural networks. Motivated by the Lagrange-d'Alembert principle and the theory of variational integrators, we introduce the notion of a Lagrange-d'Alembert map and establish a C^r convergence theorem for first-order one-step methods. Building on these results, we propose Generalized Forced Hamiltonian Neural Networks (GFHNNs), a class of structure-preserving neural networks obtained by concatenating Lagrange-d'Alembert-Euler maps, and prove a universal approximation theorem for this architecture. We further extend the framework to parameter-dependent systems, leading to Parametric Generalized Forced Hamiltonian Neural Networks (PGFHNNs). By interpreting the multiple Stratonovich integrals appearing in the Stratonovich-Taylor expansion as parameters, the same framework can be applied to stochastic forced Hamiltonian systems whenever information about the underlying Wiener process is available. Our numerical experiments demonstrate that the proposed geometric architectures provide significantly improved long-time stability and accuracy compared to non-geometric residual neural networks, while requiring substantially less training data to achieve a comparable level of performance.

Related

• Extrapolating the emergence of Hamiltonian chaos with random-feature Hamiltonian neural networks
• Data-Driven Hamiltonian Reduction for Superconducting Qubits via Meta-Learning
• Identifying the nonlinear string dynamics with port-Hamiltonian neural networks

Source: arXiv cs.LG | 2026-08-21