Learning Generalized Hamiltonians using fully Symplectic Mappings

• URL: http://arxiv.org/abs/2409.11138v1
• Date: Tue, 17 Sep 2024 12:45:49 GMT
• Title: Learning Generalized Hamiltonians using fully Symplectic Mappings
• Authors: Harsh Choudhary, Chandan Gupta, Vyacheslav kungrutsev, Melvin Leok, Georgios Korpas,
• Abstract summary: Hamiltonian systems have the important property of being conservative, that is, energy is conserved throughout the evolution. In particular Hamiltonian Neural Networks have emerged as a mechanism to incorporate structural inductive bias into the NN model. We show that symplectic schemes are robust to noise and provide a good approximation of the system Hamiltonian when the state variables are sampled from a noisy observation.
• Score: 0.32985979395737786
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many important physical systems can be described as the evolution of a Hamiltonian system, which has the important property of being conservative, that is, energy is conserved throughout the evolution. Physics Informed Neural Networks and in particular Hamiltonian Neural Networks have emerged as a mechanism to incorporate structural inductive bias into the NN model. By ensuring physical invariances are conserved, the models exhibit significantly better sample complexity and out-of-distribution accuracy than standard NNs. Learning the Hamiltonian as a function of its canonical variables, typically position and velocity, from sample observations of the system thus becomes a critical task in system identification and long-term prediction of system behavior. However, to truly preserve the long-run physical conservation properties of Hamiltonian systems, one must use symplectic integrators for a forward pass of the system's simulation. While symplectic schemes have been used in the literature, they are thus far limited to situations when they reduce to explicit algorithms, which include the case of separable Hamiltonians or augmented non-separable Hamiltonians. We extend it to generalized non-separable Hamiltonians, and noting the self-adjoint property of symplectic integrators, we bypass computationally intensive backpropagation through an ODE solver. We show that the method is robust to noise and provides a good approximation of the system Hamiltonian when the state variables are sampled from a noisy observation. In the numerical results, we show the performance of the method concerning Hamiltonian reconstruction and conservation, indicating its particular advantage for non-separable systems.

Related papers

• Hamiltonian Matching for Symplectic Neural Integrators [9.786274281068815]
  Hamilton's equations of motion form a fundamental framework in various branches of physics, including astronomy, quantum mechanics, particle physics, and climate science. Classical numerical solvers are typically employed to compute the time evolution of these systems. We propose SympFlow, a novel neural network-based symplectic integrator, which is the composition of a sequence of exact flow maps of parametrised time-dependent Hamiltonian functions.
  arXiv  Detail & Related papers  (2024-10-23T20:21:56Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Coarse-Graining Hamiltonian Systems Using WSINDy [0.0]
  We show that WSINDy can successfully identify a reduced Hamiltonian system in the presence of large intrinsics. WSINDy naturally preserves the Hamiltonian structure by restricting to a trial basis of Hamiltonian vector fields. We also provide a contribution to averaging theory by proving that first-order averaging at the level of vector fields preserves Hamiltonian structure in nearly-periodic Hamiltonian systems.
  arXiv  Detail & Related papers  (2023-10-09T17:20:04Z)
• Learning Trajectories of Hamiltonian Systems with Neural Networks [81.38804205212425]
  We propose to enhance Hamiltonian neural networks with an estimation of a continuous-time trajectory of the modeled system. We demonstrate that the proposed integration scheme works well for HNNs, especially with low sampling rates, noisy and irregular observations.
  arXiv  Detail & Related papers  (2022-04-11T13:25:45Z)
• Learning Neural Hamiltonian Dynamics: A Methodological Overview [109.40968389896639]
  Hamiltonian dynamics endows neural networks with accurate long-term prediction, interpretability, and data-efficient learning. We systematically survey recently proposed Hamiltonian neural network models, with a special emphasis on methodologies.
  arXiv  Detail & Related papers  (2022-02-28T22:54:39Z)
• Learning Hamiltonians of constrained mechanical systems [0.0]
  Hamiltonian systems are an elegant and compact formalism in classical mechanics. We propose new approaches for the accurate approximation of the Hamiltonian function of constrained mechanical systems.
  arXiv  Detail & Related papers  (2022-01-31T14:03:17Z)
• Structure-Preserving Learning Using Gaussian Processes and Variational Integrators [62.31425348954686]
  We propose the combination of a variational integrator for the nominal dynamics of a mechanical system and learning residual dynamics with Gaussian process regression. We extend our approach to systems with known kinematic constraints and provide formal bounds on the prediction uncertainty.
  arXiv  Detail & Related papers  (2021-12-10T11:09:29Z)
• Stoquasticity in circuit QED [78.980148137396]
  We show that scalable sign-problem free path integral Monte Carlo simulations can typically be performed for such systems. We corroborate the recent finding that an effective, non-stoquastic qubit Hamiltonian can emerge in a system of capacitively coupled flux qubits.
  arXiv  Detail & Related papers  (2020-11-02T16:41:28Z)
• Nonseparable Symplectic Neural Networks [23.77058934710737]
  We propose a novel neural network architecture, Nonseparable Symplectic Neural Networks (NSSNNs) NSSNNs uncover and embed the symplectic structure of a nonseparable Hamiltonian system from limited observation data. We show the unique computational merits of our approach to yield long-term, accurate, and robust predictions for large-scale Hamiltonian systems.
  arXiv  Detail & Related papers  (2020-10-23T19:50:13Z)
• Sparse Symplectically Integrated Neural Networks [15.191984347149667]
  We introduce Sparselectically Integrated Neural Networks (SSINNs) SSINNs are a novel model for learning Hamiltonian dynamical systems from data. We evaluate SSINNs on four classical Hamiltonian dynamical problems.
  arXiv  Detail & Related papers  (2020-06-10T03:33:37Z)
• On dissipative symplectic integration with applications to gradient-based optimization [77.34726150561087]
  We propose a geometric framework in which discretizations can be realized systematically. We show that a generalization of symplectic to nonconservative and in particular dissipative Hamiltonian systems is able to preserve rates of convergence up to a controlled error.
  arXiv  Detail & Related papers  (2020-04-15T00:36:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.