Mathematics – Probability
Scientific paper
2010-01-25
Mathematics
Probability
Scientific paper
We investigate the properties of the Hybrid Monte-Carlo algorithm (HMC) in high dimensions. HMC develops a Markov chain reversible w.r.t. a given target distribution $\Pi$ by using separable Hamiltonian dynamics with potential $-\log\Pi$. The additional momentum variables are chosen at random from the Boltzmann distribution and the continuous-time Hamiltonian dynamics are then discretised using the leapfrog scheme. The induced bias is removed via a Metropolis-Hastings accept/reject rule. In the simplified scenario of independent, identically distributed components, we prove that, to obtain an $\mathcal{O}(1)$ acceptance probability as the dimension $d$ of the state space tends to $\infty$, the leapfrog step-size $h$ should be scaled as $h= l \times d^{-1/4}$. Therefore, in high dimensions, HMC requires $\mathcal{O}(d^{1/4})$ steps to traverse the state space. We also identify analytically the asymptotically optimal acceptance probability, which turns out to be 0.651 (to three decimal places). This is the choice which optimally balances the cost of generating a proposal, which {\em decreases} as $l$ increases, against the cost related to the average number of proposals required to obtain acceptance, which {\em increases} as $l$ increases.
Beskos Alexandros
Pillai Natesh S.
Roberts Gareth O.
Sanz-Serna Jesus M.
Stuart Andrew M.
No associations
LandOfFree
Optimal tuning of the Hybrid Monte-Carlo Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimal tuning of the Hybrid Monte-Carlo Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal tuning of the Hybrid Monte-Carlo Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-131262