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.
Introduces HMC method for sampling Gibbs densities.
problem Sampling from Gibbs densities efficiently.
method Hamiltonian Monte Carlo (HMC) method based on Hamiltonian dynamics.
result Idealized HMC preserves the target distribution and converges under certain conditions.
Generalizes energy-momentum method for non-autonomous Hamiltonian systems.
problem Stability analysis of non-autonomous Hamiltonian systems with symmetries.
method Develops a new approach to relative equilibrium points and stability conditions for non-autonomous systems.
result Conditions ensuring stability of relative equilibrium points in non-autonomous Hamiltonian systems.
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 control and observer methods for complex systems.
problem Controlling and observing infinite-dimensional systems with boundary actuation.
method Energy-Casimir method and port-Hamiltonian system representation.
result Control law and observer designed for Kirchhoff-Love plate example.
New method improves performance of Hamiltonian MCMC for log Z estimation.
problem Estimating tight bounds on log Z for unnormalized distributions.
method Uncorrected Hamiltonian Annealing (UHA) using reparameterization gradients.
result Better performance and easier parameter tuning compared to existing methods.
New methods solve min-max problems on manifolds using Riemannian Hamiltonians.
problem Min-max optimization on Riemannian manifolds.
method Riemannian Hamiltonian methods (RHM) to minimize the Hamiltonian function.
result RHM leads to correct search directions and global optimality in min-max problems.
By making use of the symplectic reduction and the cohomogeneity method, we give a general method for constructing Hamiltonian minimal submanifolds in Kaehler manifolds with symmetries. As applications, we construct infinitely many nontrivial complete Hamiltonian minimal submanifolds in CP^n and C^n.
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.
New method combines neural networks with Monte Carlo for complex system reliability.
problem Estimating small failure probabilities in complex systems.
method Subset Simulation with Hamiltonian Neural Networks.
result High acceptance rates and computational efficiency in low-probability regions.
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.
New boundary conditions improve Hamiltonian analysis in GR.
problem Improving Hamiltonian analysis in GR with IBVP.
method Presented and analyzed new boundary conditions.
result New boundary conditions lead to better Hamiltonian analysis.
An efficient method to construct Hamiltonian structures for nonlinear evolution equations is described. It is based on the notions of variational Schouten bracket and l*-covering. The latter serves the role of the cotangent bundle in the category of nonlinear evolution PDEs. We first consider two illustrative examples …
Researchers present and compare different representations of dissipative Hamiltonian DAE systems.
problem Understanding and transforming dissipative Hamiltonian DAE systems.
method Global geometric and algebraic points of view, translations between representations, characterizations, and numerical methods for computing structural information.
result A general DAE system can be transformed into a dissipative Hamiltonian or port-Hamiltonian DAE system.
The present paper is a review of counterexamples to the ``Hamiltonian Seifert conjecture'' or, more generally, of examples of Hamiltonian systems having no periodic orbits on a compact energy level. We begin with the discussion of the ``classical'' and volume--preserving Seifert conjectures. Then a construction of coun…
New method reduces Bayesian inference time by optimizing Hamiltonian flows.
problem Efficiently constructing a Bayesian coreset with low inferential error.
method Sparse Hamiltonian flows, involving uniform subsampling and momentum quasi-refreshment steps.
result Exponential compression of the dataset and reduced KL divergence to the target.
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.
We take a Hamiltonian-based perspective to generalize Nesterov's accelerated gradient descent and Polyak's heavy ball method to a broad class of momentum methods in the setting of (possibly) constrained minimization in Euclidean and non-Euclidean normed vector spaces. Our perspective leads to a generic and unifying non…
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.
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.
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 methods improve efficiency of sampling algorithms for complex systems.
problem Efficiently sampling from complex, high-dimensional probability distributions.
method Randomized Runge-Kutta-Nyström methods tailored for Hamiltonian flows.
result Quantitative 5/2-order L2-accuracy in approximating Hamiltonian flows. New method samples from piecewise smooth distributions using Hamiltonian Monte Carlo.
problem Sampling from distributions with discontinuous gradients.
method Generalized Randomized Hamiltonian Monte Carlo (GRHMC) for piecewise smooth targets.
result GRHMC processes sample from piecewise smooth target distributions with the desired distribution as the invariant distribution.
Quantum annealing is a generic solver of the optimization problem that uses fictitious quantum fluctuation. Its simulation in classical computing is often performed using the quantum Monte Carlo simulation via the Suzuki--Trotter decomposition. However, the negative sign problem sometimes emerges in the simulation of q…
In this paper, we discuss the geometric integration of hamiltonian systems on Poisson manifolds, in particular, in the case, when the Poisson structure is induced by a Lie algebra, that is, it is a Lie-Poisson structure. A Hamiltonian system on a Poisson manifold (P,Π) is a smooth manifold P equipped with a bivect…
Constructs surfaces with conical singularities using variational methods.
problem Creating Hamiltonian Stationary Surfaces with specific singularities.
method Variational methods and convergence process similar to Ginzburg-Landau analysis.
result Obtained surfaces with prescribed conical singularities related to optimal Wente constants.
The Lagrangian representation of multi-Hamiltonian PDEs has been introduced by Y. Nutku and one of us (MVP). In this paper we focus on systems which are (at least) bi-Hamiltonian by a pair A1, A2, where A1 is a hydrodynamic-type Hamiltonian operator. We prove that finding the Lagrangian representation is equiv…
New methods accelerate gradient descent for convex and strongly convex functions.
problem Improving convergence rates of gradient-based optimization methods.
method Formulated two classes of first-order algorithms with Lyapunov analyses and Hamiltonian assisted gradient method.
result Achieved accelerated convergence rates matching Nesterov's methods in strongly and general convex settings.
In this paper, we discuss an extension of the Split Hamiltonian Monte Carlo (Split HMC) method for Gaussian process model (GPM). This method is based on splitting the Hamiltonian in a way that allows much of the movement around the state space to be done at low computational cost. To this end, we approximate the negati…
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.
This paper studies the question of when a loop φ in the group Symp(M,ω) of symplectomorphisms of a symplectic manifold (M,ω) is isotopic to a loop that is generated by a time-dependent Hamiltonian function. (Loops with this property are said to be Hamiltonian.) Our main result is that Hamiltonian loops are rigid …
We present a numerical approach for approximating unknown Hamiltonian systems using observation data. A distinct feature of the proposed method is that it is structure-preserving, in the sense that it enforces conservation of the reconstructed Hamiltonian. This is achieved by directly approximating the underlying unkno…
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.
The paper uses a Hamiltonian method to price barrier options under Vasicek interest rate model.
problem Option pricing under Vasicek interest rate model with time-varying interest rates.
method Splitting time to maturity into infinite steps and using quantum mechanics methods for matrix elements, derived pricing kernel and integral expression.
result Numerical results of option prices as functions of underlying asset price, floating rate, and regression rate.
We give examples of symplectic actions of a cyclic group, inducing a trivial action on homology, on four-manifolds that admit Hamiltonian circle actions, and show that they do not extend to Hamiltonian circle actions. Our work applies holomorphic methods to extend combinatorial tools developed for circle actions to stu…
The study analyzes stochastic Lie systems and their applications in various models.
problem Analyzing stochastic differential equations on manifolds.
method Coalgebra method for Hamiltonian stochastic Lie systems.
result New examples of stochastic Lie systems and Hamiltonian stochastic Lie systems are analyzed.
New method improves sampling from complex, multi-peaked distributions.
problem Sampling from high-dimensional, multimodal distributions using HMC.
method Combines tempered HMC with automatic tuning strategies.
result Demonstrates more effective scaling with dimension than adaptive methods.
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.
HF-opt uses Hamiltonian dynamics to optimize functions, achieving accelerated rates with randomized integration time.
problem Optimizing functions efficiently and accelerating convergence rates.
method Randomized Hamiltonian flow (RHF) with accelerated convergence rates.
result RHGD achieves accelerated convergence rates similar to Nesterov's AGD.
Simulating the time-evolution of quantum mechanical systems is BQP-hard and expected to be one of the foremost applications of quantum computers. We consider classical algorithms for the approximation of Hamiltonian dynamics using subsampling methods from randomized numerical linear algebra. We derive a simulation tech…
Hamiltonian method applied to floating barrier options pricing.
problem Pricing of floating barrier options.
method Hamiltonian approach in quantum mechanics applied to barrier options.
result Analytical expressions for pricing kernel and option price derived.
Lagrangian submanifolds of a Kaehler manifold are called Hamiltonian-stationary (or H-stationary for short) if it is a critical point of the area functional restricted to compactly supported Hamiltonian variations. In [B. Y. Chen, F. Dillen, L. Verstraelen and L. Vrancken, Lagrangian isometric immersions of a real-sp…
This paper develops a Hamiltonian reduction method for field theories over affine principal bundles.
problem Developing a Hamiltonian reduction theory for field theories over affine principal bundles.
method Introducing a canonical identification to describe the reduced multisymplectic space without a connection.
result Derivation of reduced Hamilton-Cartan equations and a reduced covariant bracket.
The paper extends Marsden-Weinstein reduction to mechanical presymplectic structures for time-dependent Hamiltonian systems.
problem Limitations of Marsden-Weinstein reduction for cosymplectic structures in time-dependent Hamiltonian systems.
method Developed Marsden-Weinstein reduction for mechanical presymplectic structures.
result Mechanical presymplectic structures provide a more suitable framework for time-dependent Hamiltonian systems than cosymplectic structures.
Develops integrators for Hamiltonian systems in Jacobi manifolds.
problem Modeling conservative systems with dissipative and thermodynamic phenomena.
method Constructs structure-preserving integrators for Hamiltonian systems in Jacobi manifolds.
result Proposes a numerical integration technique compatible with Jacobi dynamics.
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.
New Hamiltonian Monte Carlo method for non-canonical dynamics.
problem Incompatibility of canonical symplectic structure with non-canonical dynamics.
method Developed a framework for Hamiltonian Monte Carlo using non-canonical symplectic structures with implicit integration.
result Non-canonical Hamiltonian Monte Carlo provides sampling advantages.
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.