mlsanityData to 14 Oct 2026

Repelling-Attracting Hamiltonian Monte Carlo

arXiv 2403.04607 ↗First posted 7 Mar 2024math.ST astro-ph.IM stat.COcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose a variant of Hamiltonian Monte Carlo (HMC), called the Repelling-Attracting Hamiltonian Monte Carlo (RAHMC), for sampling from multimodal distributions. The key idea that underpins RAHMC is a departure from the conservative dynamics of Hamiltonian systems, which form the basis of traditional HMC, and turning instead to the dissipative dynamics of conformal Hamiltonian systems. In particular, RAHMC involves two stages: a mode-repelling stage to encourage the sampler to move away from regions of high probability density; and, a mode-attracting stage, which facilitates the sampler to find and settle near alternative modes. We achieve this by introducing just one additional tuning parameter -- the coefficient of friction. The proposed method adapts to the geometry of the target distribution, e.g., modes and density ridges, and can generate proposals that cross low-probability barriers with little to no computational overhead in comparison to traditional HMC. Notably, RAHMC requires no additional information about the target distribution or memory of previously visited modes. We establish the theoretical basis for RAHMC, and we discuss repelling-attracting extensions to several variants of HMC in literature. Finally, we provide a tuning-free implementation via dual-averaging, and we demonstrate its effectiveness in sampling from, both, multimodal and unimodal distributions in high dimensions.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 73 references that are in the map. First posted on arXiv 7 Mar 2024.

Builds on

24 of 73 references.

References · 24

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2014Stochastic Gradient Hamiltonian Monte Carlocited by 343
  3. 2017A Conceptual Introduction to Hamiltonian Monte Carlocited by 209
  4. 2018Statistical Aspects of Wasserstein Distancescited by 203
  5. 2017Generalizing Hamiltonian Monte Carlo with Neural Networkscited by 52
  6. 2019Conformal Symplectic and Relativistic Optimizationcited by 29
  7. 2020Optimization with Momentum: Dynamical, Control-Theoretic, and Symplectic Perspectivescited by 27
  8. 2018A Framework for Adaptive MCMC Targeting Multimodal Distributionscited by 21
  9. 2014The Geometric Foundations of Hamiltonian Monte Carlocited by 19
  10. 2016On the Geometric Ergodicity of Hamiltonian Monte Carlocited by 19
  11. 2015Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Familiescited by 15
  12. 2016Pseudo-Marginal Hamiltonian Monte Carlocited by 6
12 more
  1. 2017Thermostat-assisted continuously-tempered Hamiltonian Monte Carlo for Bayesian learningcited by 6
  2. 2016Relativistic Monte Carlocited by 5
  3. 2016Magnetic Hamiltonian Monte Carlocited by 4
  4. 2019Quantum-Inspired Hamiltonian Monte Carlo for Bayesian Samplingcited by 4
  5. 2017Geometry and Dynamics for Markov Chain Monte Carlocited by 3
  6. 2017Pseudo-extended Markov chain Monte Carlocited by 3
  7. 2014Adiabatic Monte Carlocited by 2
  8. 2016A Repelling-Attracting Metropolis Algorithm for Multimodalitycited by 2
  9. 2018Does Hamiltonian Monte Carlo mix faster than a random walk on multimodal densities?cited by 2
  10. 2020Non-Canonical Hamiltonian Monte Carlocited by 2
  11. 2020Globally-centered autocovariances in MCMCcited by 1
  12. 2021Sampling from high-dimensional, multimodal distributions using automatically tuned, tempered Hamiltonian Monte Carlocited by 1

Built on by

Not cited yet.