An entropic approach for Hamiltonian Monte Carlo: the idealized case
arXiv:2209.13405
Abstract
Quantitative long-time entropic convergence and short-time regularization are established for an idealized Hamiltonian Monte Carlo chain which alternatively follows an Hamiltonian dynamics for a fixed time and then partially or totally refreshes its velocity with an auto-regressive Gaussian step. These results, in discrete time, are the analogous of similar results for the continuous-time kinetic Langevin diffusion, and the latter can be obtained from our bounds in a suitable limit regime. The dependency in the log-Sobolev constant of the target measure is sharp and is illustrated on a mean-field case and on a low-temperature regime, with an application to the simulated annealing algorithm. The practical unadjusted algorithm is briefly discussed.
References in corpus (13)
- Hypocoercivity and exponential time decay for the linear inhomogeneous relaxation Boltzmann equation
- Mixing Time Guarantees for Unadjusted Hamiltonian Monte Carlo
- Convergence of unadjusted Hamiltonian Monte Carlo for mean-field models
- Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions
- Logarithmic bounds for isoperimetry and slices of convex sets
- Second order quantitative bounds for unadjusted generalized Hamiltonian Monte Carlo
- HMC and underdamped Langevin united in the unadjusted convex smooth case
- Small eigenvalues of the low temperature linear relaxation Boltzmann equation with a confining potential
- Uniform minorization condition and convergence bounds for discretizations of kinetic Langevin dynamics
- Score-Based Diffusion meets Annealed Importance Sampling
- Speeding up Langevin Dynamics by Mixing
- Nonlinear recombinations and generalized random transpositions
- Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps