Gaussian process model learns Hamiltonian systems from noisy data.
problem Learning Hamiltonian systems from long, noisy trajectories.
method Efficient decoupled parameterisation, energy-conserving shooting method.
result Robust inference from short and long trajectories.
Develops Hamiltonian Score Matching and Generative Flows for machine learning.
problem Estimating score functions and designing generative models.
method Introduces Hamiltonian velocity predictors (HVPs) for score matching and generative flows.
result Hamiltonian Generative Flows (HGFs) rival leading generative modeling techniques.
Kernel methods accurately predict Hamiltonian systems from data.
problem Data-driven simulation of Hamiltonian systems.
method Two-step and one-step kernel-based methods for identifying and forecasting Hamiltonian systems.
result Framework achieves accurate, data-efficient predictions across various benchmark systems.
Method learns molecular Hamiltonian for accurate electron dynamics predictions.
problem Predict electron dynamics in molecules using learned Hamiltonians.
method Combines linear statistical model with quantum Liouville equation time discretization.
result Predicted electron dynamics closely matches ground truth, even beyond training data.
The Hamiltonian formalism plays a central role in classical and quantum physics. Hamiltonians are the main tool for modelling the continuous time evolution of systems with conserved quantities, and they come equipped with many useful properties, like time reversibility and smooth interpolation in time. These properties…
Differentiable simulations control molecular Hamiltonians for desired outcomes.
problem Control and learning of molecular Hamiltonians for desired outcomes.
method Differentiable simulations to differentiate Hamiltonians with respect to target observables.
result Control and learning of molecular Hamiltonians for desired outcomes.
Deep learning enhances Hamiltonian Monte Carlo for sampling gauge field configurations.
problem Sampling from complex gauge field topologies efficiently.
method Stacked neural networks to generalize Hamiltonian Monte Carlo.
result Significantly reduces computational cost for generating gauge field configurations.
New method uses kernel methods to approximate ground states of quantum Hamiltonians efficiently.
problem Approximating ground states of quantum Hamiltonians using neural networks is computationally expensive.
method Introduces a statistical learning approach using kernel methods to make optimization trivial.
result Ground state properties of arbitrary gapped quantum Hamiltonians can be reached with polynomial resources.
Recurrent neural networks (RNNs) have gained a great deal of attention in solving sequential learning problems. The learning of long-term dependencies, however, remains challenging due to the problem of a vanishing or exploding hidden states gradient. By exploring further the recently established connections between RN…
New algorithms improve MCMC efficiency for complex distributions.
problem High variance and low effective sample size in MCMC samplers.
method Antithetic Riemannian Manifold and Quantum-Inspired Hamiltonian Monte Carlo.
result Improved effective sample size and variance reduction.
WSINDy identifies reduced Hamiltonian systems from particle interactions.
problem Coarse-graining Hamiltonian dynamics with approximate symmetries.
method WSINDy algorithm applied to Hamiltonian systems with timescale separation.
result WSINDy successfully identifies reduced Hamiltonian systems from noisy data.
Proposes NSSNNs to predict nonseparable Hamiltonian systems.
problem Predicting nonseparable Hamiltonian systems with coupled dynamics.
method Augmented symplectic time integrator to decouple position and momentum.
result Long-term, accurate, and robust predictions for large-scale Hamiltonian systems.
SSINNs learn Hamiltonian systems from data with interpretable, low-memory models.
problem Learning Hamiltonian dynamical systems from data efficiently and accurately.
method Combines fourth-order symplectic integration with sparse regression for a learned Hamiltonian.
result Outperforms state-of-the-art techniques in system prediction and energy conservation.
A new decentralized Bayesian learning method using Metropolis-adjusted Hamiltonian Monte Carlo.
problem Decentralized Bayesian learning with uncertainty quantification.
method Metropolis-adjusted Hamiltonian Monte Carlo in a decentralized federated learning setting.
result Theoretical guarantees and numerical effectiveness of the method on non-convex problems.
Meta learning enables cross-domain Hamiltonian dynamics.
problem Adapting to new physical systems with different laws.
method Graph Neural Network (GNN) with meta learning.
result Unified Hamiltonian representation across multiple system domains.
CHMC improves HMC efficiency for multimodal distributions.
problem Slow convergence of HMC in multimodal distributions.
method Integrates a counterdiabatic term to optimize Hamiltonian changes.
result CHMC achieves efficient sampling from challenging distributions.
Bayesian method improves forecasting of nonseparable Hamiltonian systems with noise.
problem Forecasting nonseparable Hamiltonian systems with multiplicative noise.
method Bayesian approach using deep learning and reduced-order modeling.
result Bayesian method yields up to 724 times improvement in forecasting accuracy.
Dissipative SymODEN learns dynamics with dissipation and control from data.
problem Learning dynamics with dissipation and control from observed data.
method Dissipative SymODEN encodes port-Hamiltonian dynamics into a deep learning architecture.
result The learned model reveals key aspects of the system, such as inertia, dissipation, and potential energy.
A new method learns Hamiltonian functions from noisy data.
problem Learning Hamiltonian functions from noisy observations.
method Structure-preserving kernel ridge regression method.
result The method yields excellent numerical performances.
New method uses quantum computing to process classical data efficiently.
problem Inefficient quantum machine learning due to data loading and trainability issues.
method Linear Hamiltonian-based machine learning with ground state problems for k-local Hamiltonians.
result Demonstrated the effectiveness and scalability of the method on up to 50 qubits.
Approximate Bayesian computation (ABC) is a powerful and elegant framework for performing inference in simulation-based models. However, due to the difficulty in scaling likelihood estimates, ABC remains useful for relatively low-dimensional problems. We introduce Hamiltonian ABC (HABC), a set of likelihood-free algori…
New features for quantum calculations learn N-center Hamiltonian matrix elements.
problem Quantum calculations need features for N-center Hamiltonians, not just atom-centered ones.
method Developed fully equivariant N-center features for machine learning.
result Learned matrix elements of N-center Hamiltonians efficiently.
This work generalizes Hamiltonian mechanics using closed differential forms.
problem Hidden invariants in classical Hamiltonian mechanics.
method Establishes a novel correspondence between generalized Hamiltonian mechanics and multisymplectic geometry.
result Key theorems linking classical and generalized Hamiltonian systems.
SyMetric evaluates learned Hamiltonian dynamics from images, improving model stability and interpretability.
problem Lack of reliable metrics to assess learned Hamiltonian dynamics from images.
method Developed SyMetric, a binary indicator based on Hamiltonian dynamics properties.
result SyMetric identifies architectural improvements for better dynamics learning.
Study investigates Hamiltonian systems in fibered almost-symplectic manifolds.
problem Existence and properties of non-vertical fully-Hamiltonian vector fields in almost symplectic manifolds with Lagrangian fibrations.
method Investigates vector fields in 2n-dimensional almost symplectic manifolds with Lagrangian fibrations, focusing on partially-Hamiltonian and fully-Hamiltonian vector fields.
result Non-vertical fully-Hamiltonian vector fields exist under certain genericity conditions and can be reduced to families of symplectic-Hamiltonian vector fields.
Symplectic GP regression models Hamiltonian systems for particle tracing.
problem Efficiently modeling long-term Hamiltonian flow maps for charged particles.
method Multi-output Gaussian process regression with symplectic matrix-valued covariance function.
result Symplectic methods outperform existing approaches in learning Hamiltonian functions.
Holographic energy equals Hamiltonian energy.
problem Equating holographic and Hamiltonian energies.
method Relative holographic and Hamiltonian energy comparison.
result Holographic energy is identical to Hamiltonian energy.
New method improves convergence for smooth games.
problem Improving convergence for smooth games.
method Stochastic Hamiltonian Gradient Methods (SHGD).
result SHGD converges linearly to the neighbourhood of a stationary point.
Summing Hamiltonian manifolds with a common submanifold.
problem Combining Hamiltonian manifolds with a shared submanifold.
method Establishing symplectic reduction and comparing Chern classes.
result Symplectic reduction of the sum agrees with the sum of reductions.
We consider the problem of learning an interpretable potential energy function from a Hamiltonian system's trajectories. We address this problem for classical, separable Hamiltonian systems. Our approach first constructs a neural network model of the potential and then applies an equation discovery technique to extract…
The study examines stability of Hamiltonian Poisson integrators on both integrable and non-integrable systems.
problem Investigating stability properties of Hamiltonian Poisson integrators.
method Examples of Lotka-Volterra dynamics and numerical investigations of a non-integrable system are used.
result The existence of a modified Hamiltonian is crucial for the stability of Hamiltonian Poisson integrators.
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 op…
The paper explores deformations of quasi-Hamiltonian spaces to Hamiltonian spaces.
problem Deforming quasi-Hamiltonian spaces to Hamiltonian spaces.
method Introducing and proving examples of deformations, including Lie groups and conjugacy classes.
result Moduli space of flat G-connections deforms to T*G^r+g.
This paper studies the geometry of the group of all co-Hamiltonian diffeomorphisms of a compact cosymplectic manifold (M,ω,η). The fix-point theory for co-Hamiltonian diffeomorphisms is studied, and we use Arnold's conjecture to predict the exact minimum number of fix point that such a diffeomorphism must have (thi…
Let (M,w) be a compact symplectic 2n-manifold, and g a Riemannian metric on M compatible with w. For instance, g could be Kahler, with Kahler form w. Consider compact Lagrangian submanifolds L of M. We call L Hamiltonian stationary, or H-minimal, if it is a critical point of the volume functional under Hamiltonian defo…
HDNNs can approximate any continuous function, proving their expressivity.
problem Lack of a comprehensive study on the expressivity of HDNNs.
method Discretization of Hamiltonian Neural Ordinary Differential Equations (HNN-ODEs).
result HDNNs can approximate any continuous function over a compact domain.
New integrators preserve geometric structure in Hamiltonian systems.
problem Preserving geometric structure in Hamiltonian systems on Jacobi manifolds.
method Combining Poissonization and symplectic bi-realizations to construct structure-preserving integrators.
result Explicit construction and application of Jacobi Hamiltonian integrators.
The paper develops a theory linking Hamiltonian and quasi-Hamiltonian manifolds.
problem Understanding the deformation of Hamiltonian quasi-Poisson manifolds to Hamiltonian Poisson manifolds.
method Introduces a generalized Hamiltonian deformation theory and constructs a topological quantum field theory.
result Shows that the imploded cross section of the double $D(G)_\imp$ deforms to the implosion of the cotangent bundle $T^*G_\imp$.
Gauss diagrams' properties can change with Hamiltonian cycle choice.
problem The impact of Hamiltonian cycle choice on Gauss diagrams.
method Examined realizable and unrealizable Gauss diagrams, and proved preservation of realizability under certain Hamiltonian cycle changes.
result Properties of Gauss diagrams can vary with Hamiltonian cycle choice.
Canonical transformation plays a fundamental role in simplifying and solving classical Hamiltonian systems. We construct flexible and powerful canonical transformations as generative models using symplectic neural networks. The model transforms physical variables towards a latent representation with an independent harm…
We classify compact, connected Hamiltonian and quasi-Hamiltonian manifolds of cohomogeneity one (which is the same as being multiplicity free of rank one). Here the group acting is a compact connected Lie group (simply connected in the quasi-Hamiltonian case). This work is a concretization of the more general classific…
We propose a new sampling method, the thermostat-assisted continuously-tempered Hamiltonian Monte Carlo, for Bayesian learning on large datasets and multimodal distributions. It simulates the Nosé-Hoover dynamics of a continuously-tempered Hamiltonian system built on the distribution of interest. A significant advantag…
Quantum computers can simulate flow models efficiently.
problem Efficiently simulating continuous flow models on quantum computers.
method Relating flow models to the Schrödinger equation and proving efficient Hamiltonian simulation.
result Quantum computers can prepare qsamples for flow models efficiently.
Classifies compact multiplicity free quasi-Hamiltonian manifolds.
problem Classifying compact, multiplicity free, quasi-Hamiltonian manifolds.
method Symplectic reductions and Lie group analysis.
result Recover old and find new examples of these structures.
Hamiltonian dynamics-based algorithms achieve deterministic and accelerated convergence for convex optimization.
problem Accelerating convex optimization
method Hamiltonian dynamics
result Hamiltonian dynamics-based algorithms achieve deterministic and accelerated convergence for convex optimization.
Arnold-Liouville systems cannot be bi-Hamiltonian generically.
problem The bi-Hamiltonian structure of Arnold-Liouville systems.
method Proving that a specific class of smooth functions is a meagre subset for the Fréchet topology, which implies Arnold-Liouville systems cannot be bi-Hamiltonian.
result Generically, Arnold-Liouville systems cannot be bi-Hamiltonian.
New method calculates volume-renormalized mass from Hamiltonian perspective.
problem Calculating volume-renormalized mass for asymptotically hyperbolic manifolds.
method Using Michel's mass invariants and a reduced Hamiltonian perspective, the volume-renormalized mass is deduced.
result The reduced Hamiltonian recovers the volume-renormalized mass and its variations.
Survey on strong closing lemmas in Hamiltonian dynamics.
problem Understanding dynamics in Hamiltonian systems.
method Use spectral invariants in symplectic geometry.
result Proofs of strong closing lemmas in various dimensions.