Unbiasing Hamiltonian Monte Carlo Algorithms for a General Hamiltonian Function

被引:0
|
作者
Lelievre, T. [1 ,2 ]
Santet, R. [1 ,2 ]
Stoltz, G. [1 ,2 ]
机构
[1] CERMICS, Ecole Ponts, Marne La Vallee, France
[2] Inria, MATHERIALS Project Team, Paris, France
基金
欧洲研究理事会;
关键词
Hamiltonian Monte Carlo; Non-separable Hamiltonian; Reversibility check; MOLECULAR-DYNAMICS; LANGEVIN DYNAMICS; ACCELERATED CONVERGENCE; GEOMETRIC ERGODICITY; VARIANCE REDUCTION; BROWNIAN DYNAMICS; SAMPLING METHODS; EQUATIONS; MOTION; ERROR;
D O I
10.1007/s10208-024-09677-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo method that allows to sample high dimensional probability measures. It relies on the integration of the Hamiltonian dynamics to propose a move which is then accepted or rejected thanks to a Metropolis procedure. Unbiased sampling is guaranteed by the preservation by the numerical integrators of two key properties of the Hamiltonian dynamics: volume-preservation and reversibility up to momentum reversal. For separable Hamiltonian functions, some standard explicit numerical schemes, such as the St & ouml;rmer-Verlet integrator, satisfy these properties. However, for numerical or physical reasons, one may consider a Hamiltonian function which is nonseparable, in which case the standard numerical schemes which preserve the volume and satisfy reversibility up to momentum reversal are implicit. When implemented in practice, such implicit schemes may admit many solutions or none, especially when the timestep is too large. We show here how to enforce the numerical reversibility, and thus unbiasedness, of HMC schemes in this context by introducing a reversibility check. In addition, for some specific forms of the Hamiltonian function, we discuss the consistency of these HMC schemes with some Langevin dynamics, and show in particular that our algorithm yields an efficient discretization of the metropolized overdamped Langevin dynamics with position-dependent diffusion coefficients. Numerical results illustrate the relevance of the reversibility check on simple problems.
引用
收藏
页数:74
相关论文
共 50 条
  • [21] Couplings for Multinomial Hamiltonian Monte Carlo
    Xu, Kai
    Fjelde, Tor Erlend
    Sutton, Charles
    Ge, Hong
    24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130
  • [22] The geometric foundations of Hamiltonian Monte Carlo
    Betancourt, Michael
    Byrne, Simon
    Livingstone, Sam
    Girolami, Mark
    BERNOULLI, 2017, 23 (4A) : 2257 - 2298
  • [23] Stochastic approximation Hamiltonian Monte Carlo
    Yun, Jonghyun
    Shin, Minsuk
    Hoon Jin, Ick
    Liang, Faming
    JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 2020, 90 (17) : 3135 - 3156
  • [24] Unbiased Hamiltonian Monte Carlo with couplings
    Heng, J.
    Jacob, P. E.
    BIOMETRIKA, 2019, 106 (02) : 287 - 302
  • [25] Stochastic Gradient Hamiltonian Monte Carlo
    Chen, Tianqi
    Fox, Emily B.
    Guestrin, Carlos
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 32 (CYCLE 2), 2014, 32 : 1683 - 1691
  • [26] Reflection, Refraction, and Hamiltonian Monte Carlo
    Afshar, Hadi Mohasel
    Domke, Justin
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 28 (NIPS 2015), 2015, 28
  • [27] Quantum dynamical Hamiltonian Monte Carlo
    Lockwood, Owen
    Weiss, Peter
    Aronshtein, Filip
    Verdon, Guillaume
    PHYSICAL REVIEW RESEARCH, 2024, 6 (03):
  • [28] Adaptive Magnetic Hamiltonian Monte Carlo
    Mongwe, Wilson Tsakane
    Mbuvha, Rendani
    Marwala, Tshilidzi
    IEEE ACCESS, 2021, 9 : 152993 - 153003
  • [29] Probabilistic Path Hamiltonian Monte Carlo
    Vu Dinh
    Bilge, Arman
    Zhang, Cheng
    Matsen, Frederick A.
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [30] Shadow Manifold Hamiltonian Monte Carlo
    van der Heide, Chris
    Hodgkinson, Liam
    Roosta, Fred
    Kroese, Dirk P.
    24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130