Training Hamiltonian neural networks without backpropagation
About
Neural networks that synergistically integrate data and physical laws offer great promise in modeling dynamical systems. However, iterative gradient-based optimization of network parameters is often computationally expensive and suffers from slow convergence. In this work, we present a backpropagation-free algorithm to accelerate the training of neural networks for approximating Hamiltonian systems through data-agnostic and data-driven algorithms. We empirically show that data-driven sampling of the network parameters outperforms data-agnostic sampling or the traditional gradient-based iterative optimization of the network parameters when approximating functions with steep gradients or wide input domains. We demonstrate that our approach is more than 100 times faster with CPUs than the traditionally trained Hamiltonian Neural Networks using gradient-based iterative optimization and is more than four orders of magnitude accurate in chaotic examples, including the H\'enon-Heiles system.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Chaotic system approximation | Hénon-Heiles | Relative L2 Error6.80e-8 | 5 | |
| Hamiltonian Dynamics Modeling | Double pendulum | Relative L2 Error0.0041 | 5 | |
| Hamiltonian approximation | Single pendulum eq. B.4 Domain [-2π, 2π] × [-6, 6] | Relative L2 Error1.55e-9 | 4 | |
| Hamiltonian approximation | Lotka-Volterra eq. B.6, Domain [-5, 5] × [-5, 5] | Relative L2 Error7.99e-9 | 4 | |
| Hamiltonian approximation | Lotka-Volterra eq. B.7 Domain [0, 8] × [0, 8] | Relative L2 Error1.51e-6 | 4 | |
| Hamiltonian approximation | Single pendulum Domain [-2π, 2π] × [-1, 1] | Relative L2 Error3.62e-10 | 4 | |
| Hamiltonian approximation | Lotka-Volterra eq. B.6 Domain [-2, 2] × [-2, 2] | Relative L2 Error1.48e-10 | 4 |