Abstract

We study Hamiltonian Monte Carlo (HMC) samplers based on splitting the Hamiltonian HH as H0(θ,p)+U1(θ)H_0(θ,p)+U_1(θ), where H0H_0 is quadratic and U1U_1 small. We show that, in general, such samplers suffer from stepsize stability restrictions similar to those of algorithms based on the standard leapfrog integrator. The restrictions may be circumvented by preconditioning the dynamics. Numerical experiments show that, when the H0(θ,p)+U1(θ)H_0(θ,p)+U_1(θ) splitting is combined with preconditioning, it is possible to construct samplers far more efficient than standard leapfrog HMC.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.