Pith. sign in

REVIEW 1 cited by

Forecasting Hamiltonian dynamics without canonical coordinates

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 2010.15201 v1 pith:JRVZJQH4 submitted 2020-10-28 cs.LG nlin.CD

classification cs.LGnlin.CD
keywords coordinatesnetworkstheycanonicaldatadynamicshamiltonianneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Conventional neural networks are universal function approximators, but because they are unaware of underlying symmetries or physical laws, they may need impractically many training data to approximate nonlinear dynamics. Recently introduced Hamiltonian neural networks can efficiently learn and forecast dynamical systems that conserve energy, but they require special inputs called canonical coordinates, which may be hard to infer from data. Here we significantly expand the scope of such networks by demonstrating a simple way to train them with any set of generalised coordinates, including easily observable ones.

Discussion (0). Continue with ORCID 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. Efficient PINNs via Multi-Head Unimodular Regularization of the Solutions Space

    cs.LG 2025-01 conditional novelty 4.0 of 10

    Adding a penalty on the determinant of the metric of a PINN's latent space improves transfer learning to stiffer regimes in three ODE examples.

Pith tools