A backpropagation-free training approach for Hamiltonian neural networks via data-driven parameter sampling that claims over 100x CPU speedup and four orders of magnitude better accuracy on chaotic systems like Hénon-Heiles compared to gradient-based methods.
Universal approximation using incremental constructive feedforward networks with random hidden nodes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Training Hamiltonian neural networks without backpropagation
A backpropagation-free training approach for Hamiltonian neural networks via data-driven parameter sampling that claims over 100x CPU speedup and four orders of magnitude better accuracy on chaotic systems like Hénon-Heiles compared to gradient-based methods.