Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

18355370 · Jun 202019922001200920172026
48 results for Hamiltonian Monte Carlo

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/25/2-order L2L^2-accuracy in approximating Hamiltonian flows.

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.

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.

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.

New algorithm speeds up MCMC for complex distributions.

problem Efficient sampling from complex, high-dimensional distributions.
method Numerical Generalized Randomized Hamiltonian Monte Carlo with state-dependent event rates.
result Approximates Hamiltonian trajectories for robust sampling.

Researchers estimate optimal PAC-Bayes bounds using Hamiltonian Monte Carlo.

problem Estimating tight PAC-Bayes bounds with restricted posterior families.
method Sampling from optimal Gibbs posterior using Hamiltonian Monte Carlo, estimating KL divergence, and proposing high-probability bounds.
result Significant tightness gaps in PAC-Bayes bounds, up to 5-6% in some cases.

Hamiltonian Monte Carlo (HMC) exploits Hamiltonian dynamics to construct efficient proposals for Markov chain Monte Carlo (MCMC). In this paper, we present a generalization of HMC which exploits \textit{non-canonical} Hamiltonian dynamics. We refer to this algorithm as magnetic HMC, since in 3 dimensions a subset of th…

2016-07-10abs ↗pdf ↗

Hamiltonian Monte Carlo (HMC) is a popular Markov chain Monte Carlo (MCMC) algorithm that generates proposals for a Metropolis-Hastings algorithm by simulating the dynamics of a Hamiltonian system. However, HMC is sensitive to large time discretizations and performs poorly if there is a mismatch between the spatial geo…

2016-09-14abs ↗pdf ↗

Hamiltonian Monte Carlo on ReLU networks is inefficient due to large local error.

problem Inefficiency of Hamiltonian Monte Carlo on ReLU neural networks.
method Analysis of Hamiltonian Monte Carlo with leapfrog integrator for Bayesian neural network inference.
result Leapfrog HMC for ReLU networks has a large local error rate of Ω(ε)Ω(ε), leading to inefficiency.

Reflective Hamiltonian Monte Carlo struggles with high-dimensional sampling.

problem Slow mixing in reflective Hamiltonian Monte Carlo with inexact reflections.
method Quantifying instantaneous non-uniformity with Sinkhorn divergence; analyzing particle motion in spheres and cubes; constructing low-dimensional toy models.
result Particles spontaneously unmix, leading to resonances in particle density.

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 controls bias in unadjusted Hamiltonian Monte Carlo and underdamped Langevin.

problem Bias in unadjusted Hamiltonian Monte Carlo and underdamped Langevin samplers.
method Delocalization of bias technique applied to these samplers.
result Control W2W_2 bias with O(K)O(\sqrt{K}) integration steps for high-dimensional distributions.

This paper extends AD techniques to Monte Carlo processes for efficient derivative calculation.

problem Obtaining derivatives of expectation values in Monte Carlo processes.
method Two approaches: reweighting and Hamiltonian extension of HMC.
result Hamiltonian approach as a change of variables simplifies variance reduction.

HH-VAEM improves imputation and acquisition of missing data using hierarchical models and Hamiltonian Monte Carlo.

problem Imputation and acquisition of missing heterogeneous data.
method Hierarchical VAE model with Hamiltonian Monte Carlo and automatic hyper-parameter tuning.
result HH-VAEM outperforms existing methods in imputation and supervised learning tasks.

New method improves sampling efficiency in complex stochastic systems.

problem Sampling efficiency in nonconvex stochastic gradient cases.
method Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo.
result Quantitative Gaussian concentration bounds and convergence rates established.

In most sampling algorithms, including Hamiltonian Monte Carlo, transition rates between states correspond to the probability of making a transition in a single time step, and are constrained to be less than or equal to 1. We derive a Hamiltonian Monte Carlo algorithm using a continuous time Markov jump process, and ar…

2015-09-13abs ↗pdf ↗

FA-HMC improves Bayesian federated learning with rigorous guarantees.

problem Parameter estimation and uncertainty quantification in non-iid distributed data.
method Federated Averaging stochastic Hamiltonian Monte Carlo (FA-HMC) with convergence guarantees.
result FA-HMC achieves better convergence and communication efficiency than existing methods.

New method uses symmetric splitting for efficient HMC inference in large neural networks.

problem Efficient inference for Bayesian neural networks with large datasets.
method Introduces a symmetric integration scheme for Hamiltonian Monte Carlo (HMC) that does not rely on stochastic gradients.
result Symmetric splitting leads to more efficient HMC inference over large data sets.

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.

A new tamed stochastic gradient Hamiltonian Monte Carlo algorithm for superlinearly growing stochastic gradients.

problem Sampling and stochastic optimization problems with superlinearly growing stochastic gradients.
method Tamed Stochastic Gradient Hamiltonian Monte Carlo (tSGHMC) algorithm.
result Established a non-asymptotic error bound in Wasserstein-2 distance with a convergence rate of 1/41/4.

NP-HMC extends HMC for nonparametric models in probabilistic programming.

problem Inference for nonparametric models in probabilistic programming.
method Introduces NP-HMC, a generalization of HMC for nonparametric models using tree representable functions.
result Empirically shows significant performance improvements over existing approaches.

Improves sampling efficiency for complex Bayesian models.

problem Inference challenges in hierarchical Gaussian-process models.
method Optimised Riemannian-manifold Hamiltonian Monte Carlo (RMHMC) with dynamic programming.
result Significant improvement in sampling efficiency and model evidence calculation.

We develop an HMC algorithm to easily marginalize random effects in LMMs.

problem Bayesian inference in LMMs is challenging, especially marginalizing random effects.
method Developed an HMC algorithm to marginalize random effects in LMMs efficiently.
result Marginalization is always beneficial when applicable and improves various models, especially cognitive science models.

Stochastic Gradient Hamiltonian Monte Carlo (SGHMC) is a momentum version of stochastic gradient descent with properly injected Gaussian noise to find a global minimum. In this paper, non-asymptotic convergence analysis of SGHMC is given in the context of non-convex optimization, where subsampling techniques are used o…

2019-03-25abs ↗pdf ↗

We present a general-purpose method to train Markov chain Monte Carlo kernels, parameterized by deep neural networks, that converge and mix quickly to their target distribution. Our method generalizes Hamiltonian Monte Carlo and is trained to maximize expected squared jumped distance, a proxy for mixing speed. We demon…

2017-11-25abs ↗pdf ↗

HMC improves Gaussian sampling efficiency with long, random steps.

problem Efficiently sampling from high-dimensional Gaussian distributions.
method Hamiltonian Monte Carlo with long and random integration times.
result HMC achieves ε\varepsilon-closeness in total variation distance with O~(κd1/4log(1/ε))\widetilde{O}(\sqrt{\kappa} d^{1/4} \log(1/\varepsilon)) gradient queries.

A new method uses Hamiltonian Monte Carlo for imputation and augmentation of healthcare data.

problem Missing values in clinical studies lead to biased results and loss of statistical power.
method Folded Hamiltonian Monte Carlo (F-HMC) with Bayesian inference to handle high-dimensional, small sample size datasets.
result The method enriches the quality of data in precision, accuracy, recall, F1 score, and propensity metric.

We unify slice sampling and Hamiltonian Monte Carlo (HMC) sampling, demonstrating their connection via the Hamiltonian-Jacobi equation from Hamiltonian mechanics. This insight enables extension of HMC and slice sampling to a broader family of samplers, called Monomial Gamma Samplers (MGS). We provide a theoretical anal…

2016-02-25abs ↗pdf ↗

Based on a new coupling approach, we prove that the transition step of the Hamiltonian Monte Carlo algorithm is contractive w.r.t. a carefully designed Kantorovich (L1 Wasserstein) distance. The lower bound for the contraction rate is explicit. Global convexity of the potential is not required, and thus multimodal targ…

2018-05-01abs ↗pdf ↗

A new GP method enforces physical constraints in probabilistic terms.

problem Unbounded model in GP regression leading to infeasible values.
method Introduces a new GP method using QHMC to enforce soft inequality and monotonicity constraints.
result Improves accuracy and reduces variance in GP model.