Pith. sign in

REVIEW 1 cited by

Deep Hamiltonian networks based on symplectic integrators

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 2004.13830 v1 pith:LSUXUV5J submitted 2020-04-23 math.NA cs.NA

classification math.NAcs.NA
keywords hnetsintegratorsnetworksymplectichamiltoniantargetsdataloss
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

HNets is a class of neural networks on grounds of physical prior for learning Hamiltonian systems. This paper explains the influences of different integrators as hyper-parameters on the HNets through error analysis. If we define the network target as the map with zero empirical loss on arbitrary training data, then the non-symplectic integrators cannot guarantee the existence of the network targets of HNets. We introduce the inverse modified equations for HNets and prove that the HNets based on symplectic integrators possess network targets and the differences between the network targets and the original Hamiltonians depend on the accuracy orders of the integrators. Our numerical experiments show that the phase flows of the Hamiltonian systems obtained by symplectic HNets do not exactly preserve the original Hamiltonians, but preserve the network targets calculated; the loss of the network target for the training data and the test data is much less than the loss of the original Hamiltonian; the symplectic HNets have more powerful generalization ability and higher accuracy than the non-symplectic HNets in addressing predicting issues. Thus, the symplectic integrators are of critical importance for HNets.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Stochastic Hamiltonian Systems via Stochastic Generating Function Neural Network

    math.DS 2025-07 conditional novelty 6.0 of 10

    SGFNN learns a stochastic generating function via an autoencoder from paired state observations, yielding symplectic and more accurate long-term predictions for stochastic Hamiltonian systems than sFML.

Pith tools