Lifting non-conservative, actuated, and contact-constrained robot dynamics into an exactly symplectic phase-space map yields state-of-the-art out-of-distribution autoregressive rollout error at low parameter and FLOP cost.
Symplectic Neural Networks Based on Dynamical Systems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We present and analyze a framework for designing symplectic neural networks (SympNets) based on geometric integrators for Hamiltonian differential equations. The SympNets are universal approximators in the space of Hamiltonian diffeomorphisms, interpretable and have a non-vanishing gradient property. We also give a representation theory for linear systems, meaning the proposed P-SympNets can exactly parameterize any symplectic map corresponding to quadratic Hamiltonians. Extensive numerical tests demonstrate increased expressiveness and accuracy -- often several orders of magnitude better -- for lower training cost over existing architectures. Lastly, we show how to perform symbolic Hamiltonian regression with SympNets for polynomial systems using backward error analysis.
fields
cs.RO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
CaLiSym: Learning Symplectic Dynamics of Real-World Systems through Structured Canonical Lifts
Lifting non-conservative, actuated, and contact-constrained robot dynamics into an exactly symplectic phase-space map yields state-of-the-art out-of-distribution autoregressive rollout error at low parameter and FLOP cost.