Pith. sign in

REVIEW 5 cited by

Symplectic Recurrent Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1909.13334 v2 pith:J3KBA6XR submitted 2019-09-29 cs.LG stat.ML

classification cs.LGstat.ML
keywords systemshamiltonianneuralsymplecticintegrationnetworksrecurrentsrnn
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose Symplectic Recurrent Neural Networks (SRNNs) as learning algorithms that capture the dynamics of physical systems from observed trajectories. An SRNN models the Hamiltonian function of the system by a neural network and furthermore leverages symplectic integration, multiple-step training and initial state optimization to address the challenging numerical issues associated with Hamiltonian systems. We show that SRNNs succeed reliably on complex and noisy Hamiltonian systems. We also show how to augment the SRNN integration scheme in order to handle stiff dynamical systems such as bouncing billiards.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 65 citations worldwide. Full citation record

  1. Structure-Preserving Digital Twins via Conditional Neural Whitney Forms

    cs.LG 2025-08 unverdicted novelty 6.0 of 10

    A transformer-based architecture learns a structure-preserving reduced finite element model, with conservation laws held exactly by the finite element exterior calculus construction, for data-calibrated real-time digi...

  2. Learning long range dependencies through time reversal symmetry breaking

    cs.LG 2025-06 conditional novelty 6.0 of 10

    RHEL computes backpropagation-equivalent gradients for Hamiltonian recurrent networks using finite differences of time-reversed, nudged trajectories, and matches BPTT accuracy on sequence tasks up to 50k steps.

  3. A hierarchy of thermodynamics learning frameworks for inelastic constitutive modeling

    cond-mat.mtrl-sci 2026-03 conditional novelty 5.0 of 10

    With identical neural building blocks, dissipation-potential, GSM, and metriplectic models all learn accurate inelastic stress responses; performance differences are modest and dataset-dependent.

  4. Symplectic Representation of Legendre Dynamics

    cs.LG 2025-12 reject novelty 5.0 of 10

    Hamiltonian flows at most linear in momentum are exactly the updates that preserve Legendre-duality graphs, and Symplectic Reservoirs built from them keep representations Legendre-dual at every step.

  5. Chaoticus: a parallel approach to the computation of chaos indicators

    nlin.CD 2025-07 reject novelty 3.0 of 10

    Chaoticus is a Python package that moves chaos indicator computations (SALI, GALI, Lagrangian descriptors, Lyapunov exponents) onto GPUs and claims order-of-magnitude speedups.

Pith tools