Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Conservative Hamiltonian Monte Carlo (2206.06901v1)

Published 14 Jun 2022 in math.NA, cs.NA, stat.CO, and stat.ME

Abstract: We introduce a new class of Hamiltonian Monte Carlo (HMC) algorithm called Conservative Hamiltonian Monte Carlo (CHMC), where energy-preserving integrators, derived from the Discrete Multiplier Method, are used instead of symplectic integrators. Due to the volume being no longer preserved under such a proposal map, a correction involving the determinant of the Jacobian of the proposal map is introduced within the acceptance probability of HMC. For a $p$-th order accurate energy-preserving integrator using a time step size $\tau$, we show that CHMC satisfies stationarity without detailed balance. Moreover, we show that CHMC satisfies approximate stationarity with an error of $\mathcal{O}(\tau{(m+1)p})$ if the determinant of the Jacobian is truncated to its first $m+1$ terms of its Taylor polynomial in $\taup$. We also establish a lower bound on the acceptance probability of CHMC which depends only on the desired tolerance $\delta$ for the energy error and approximate determinant. In particular, a cost-effective and gradient-free version of CHMC is obtained by approximating the determinant of the Jacobian as unity, leading to an $\mathcal{O}(\taup)$ error to the stationary distribution and a lower bound on the acceptance probability depending only on $\delta$. Furthermore, numerical experiments show increased performance in acceptance probability and convergence to the stationary distribution for the Gradient-free CHMC over HMC in high dimensional problems.

Summary

We haven't generated a summary for this paper yet.