Author:
Casas Fernando,Sanz-Serna Jesús María,Shaw Luke
Abstract
AbstractWe study Hamiltonian Monte Carlo (HMC) samplers based on splitting the Hamiltonian H as $$H_0(\theta ,p)+U_1(\theta )$$
H
0
(
θ
,
p
)
+
U
1
(
θ
)
, where $$H_0$$
H
0
is quadratic and $$U_1$$
U
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 $$H_0(\theta ,p)+U_1(\theta )$$
H
0
(
θ
,
p
)
+
U
1
(
θ
)
splitting is combined with preconditioning, it is possible to construct samplers far more efficient than standard leapfrog HMC.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Statistics, Probability and Uncertainty,Statistics and Probability,Theoretical Computer Science
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献