English
Related papers

Related papers: Repelling-Attracting Hamiltonian Monte Carlo

200 papers

We propose a new Monte Carlo method for sampling from multimodal distributions. The idea of this technique is based on splitting the task into two: finding the modes of a target distribution $\pi$ and sampling, given the knowledge of the…

Computation · Statistics 2019-01-14 Emilia Pompe , Chris Holmes , Krzysztof Łatuszyński

Markov chain Monte Carlo methods have become standard tools in statistics to sample from complex probability measures. Many available techniques rely on discrete-time reversible Markov chains whose transition kernels build up over the…

Methodology · Statistics 2017-02-21 Alexandre Bouchard-Côté , Sebastian J. Vollmer , Arnaud Doucet

We propose a Monte Carlo sampler from the reverse diffusion process. Unlike the practice of diffusion models, where the intermediary updates -- the score functions -- are learned with a neural network, we transform the score matching…

Machine Learning · Statistics 2024-03-14 Xunpeng Huang , Hanze Dong , Yifan Hao , Yi-An Ma , Tong Zhang

With the recently increased interest in probabilistic models, the efficiency of an underlying sampler becomes a crucial consideration. Hamiltonian Monte Carlo (HMC) is one popular option for models of this kind. Performance of the method,…

Hamiltonian Monte Carlo (HMC) is a popular sampling method in Bayesian inference. Recently, Heng & Jacob (2019) studied Metropolis HMC with couplings for unbiased Monte Carlo estimation, establishing a generic parallelizable scheme for HMC.…

Methodology · Statistics 2021-04-13 Kai Xu , Tor Erlend Fjelde , Charles Sutton , Hong Ge

Hamiltonian Monte Carlo (HMC) is a widely used sampler for continuous probability distributions. In many cases, the underlying Hamiltonian dynamics exhibit a phenomenon of resonance which decreases the efficiency of the algorithm and makes…

Computation · Statistics 2023-02-23 Lionel Riou-Durand , Pavel Sountsov , Jure Vogrinc , Charles C. Margossian , Sam Power

Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo (MCMC) algorithm that avoids the random walk behavior and sensitivity to correlated parameters that plague many MCMC methods by taking a series of steps informed by first-order…

Computation · Statistics 2015-03-19 Matthew D. Hoffman , Andrew Gelman

Riemannian manifold Hamiltonian Monte Carlo (RMHMC) is a sampling algorithm that seeks to adapt proposals to the local geometry of the posterior distribution. The specific form of the Hamiltonian used in RMHMC necessitates {\it…

Computation · Statistics 2021-11-22 James A. Brofos , Roy R. Lederman

Hamiltonian Monte Carlo (HMC) is an efficient method of simulating smooth distributions and has motivated the widely used No-U-turn Sampler (NUTS) and software Stan. We build on NUTS and the technique of "unbiased sampling" to design HMC…

Computation · Statistics 2022-12-26 George M. Leigh , Amanda R. Northrop

In this paper, we propose a discontinuous Hamilton Monte Carlo (DHMC) to sample from dimensional varying distributions, and particularly the grand canonical ensemble. The DHMC was proposed in [Biometrika, 107(2)] for discontinuous potential…

Numerical Analysis · Mathematics 2025-05-16 Lei Li , Xiangxian Luo , Yinchen Luo

Sequential Monte Carlo (SMC) methods are a class of Monte Carlo methods that are used to obtain random samples of a high dimensional random variable in a sequential fashion. Many problems encountered in applications often involve different…

Methodology · Statistics 2018-12-20 Chencheng Cai , Rong Chen , Ming Lin

Hamiltonian Monte Carlo (HMC) is an efficient and effective means of sampling posterior distributions on Euclidean space, which has been extended to manifolds with boundary. However, some applications require an extension to more general…

Populations and Evolution · Quantitative Biology 2017-06-26 Vu Dinh , Arman Bilge , Cheng Zhang , Frederick A. Matsen

History-dependent sampling can reduce long-run Monte Carlo variance by discouraging redundant revisits, but existing schemes typically encode history through empirical measure on finite state spaces, which is infeasible in high-dimensional…

Machine Learning · Computer Science 2026-05-26 Jie Hu , Lingyun Chen , Geeho Kim , Jinyoung Choi , Bohyung Han , Do Young Eun

Variational inference lies at the core of many state-of-the-art algorithms. To improve the approximation of the posterior beyond parametric families, it was proposed to include MCMC steps into the variational lower bound. In this work we…

Machine Learning · Statistics 2016-09-28 Christopher Wolf , Maximilian Karl , Patrick van der Smagt

We present a method for performing Hamiltonian Monte Carlo that largely eliminates sample rejection for typical hyperparameters. In situations that would normally lead to rejection, instead a longer trajectory is computed until a new state…

Computation · Statistics 2016-03-29 Jascha Sohl-Dickstein , Mayur Mudigonda , Michael R. DeWeese

Hamiltonian Monte Carlo (HMC) is a powerful algorithm to sample latent variables from Bayesian models. The advent of probabilistic programming languages (PPLs) frees users from writing inference algorithms and lets users focus on modeling.…

Machine Learning · Computer Science 2023-06-05 Jinlin Lai , Javier Burroni , Hui Guan , Daniel Sheldon

In Bayesian inference, Hamiltonian Monte Carlo (HMC) is a popular Markov Chain Monte Carlo (MCMC) algorithm known for its efficiency in sampling from complex probability distributions. However, its application to models with latent…

Computation · Statistics 2025-04-15 Alaa Amri , Víctor Elvira , Amy L. Wilson

Hamiltonian Monte Carlo (HMC) is a widely deployed method to sample from high-dimensional distributions in Statistics and Machine learning. HMC is known to run very efficiently in practice and its popular second-order "leapfrog"…

Data Structures and Algorithms · Computer Science 2018-08-13 Oren Mangoubi , Nisheeth K. Vishnoi

Hamiltonian Flow Monte Carlo(HFMC) methods have been implemented in engineering, biology and chemistry. HFMC makes large gradient based steps to rapidly explore the state space. The application of the Hamiltonian dynamics allows to estimate…

Computation · Statistics 2017-09-06 Raphael Douady , Shohruh Miryusupov

Hamiltonian dynamics can be used to produce distant proposals for the Metropolis algorithm, thereby avoiding the slow exploration of the state space that results from the diffusive behaviour of simple random-walk proposals. Though…

Computation · Statistics 2021-06-30 Radford M. Neal