On the convergence of Hamiltonian Monte Carlo
Alain Durmus, Eric Moulines, Eero Saksman
Introduction
HMC algorithms have achieved many empirical successes. Recently, the theory on HMC have been addressed by many authors ; see . An in depth discussion of the HMC method and a survey of the existing results are given in .
Another important property of Hamiltonian flow is the conservation of energy. Since is skew-symmetric, for any solution of (4)
Despite many recent advances, theoretical properties of the HMC algorithm are still not completely understood. This paper addresses two important issues in the analysis of HMC algorithm: irreducibility and geometric ergodicity.
In a second part, we establish the geometric ergodicity of the HMC sampler under the assumptions that the potential is homogeneous outside a ball (or is a perturbation of an homogeneous function) and that the level sets are convex. Our assumptions imply that the proposal kernel of HMC satisfies an ‘inwards acceptance’ property , which is essential to show that HMC (and MALA) is geometrically ergodic.
Our results complement the recent paper . This paper provides a variety of conditions under which the HMC algorithm is not geometrically ergodic. It establishes the geometric ergodicity under the abstract ’inwards acceptance’ property for which we provide verifiable sufficient conditions.
Ergodicity of the HMC algorithm
The proof is postponed to Section 5.1.1. ∎
In our next result, we relax the second order differentiability condition on , and in the case we even allow for arbitrary large values of the step size and the number of iterations . The result is less quantitative and the proof is more involved: we use degree theory for continuous mapping (the main notions required in the proof are recalled in Section 4).
1 for some ,
The proof is postponed to Section 5.1.2. ∎
To the best of the author’s knowledge, the first results regarding the irreducibility of the HMC algorithm are established in under the assumption that and are bounded above. Note that these assumptions are in general satisfied only for compact state space. Irreducibility has also been tackled in : in this work however, the number of leapfrog steps is assumed to be random and independent of the current position and momentum. Under this setting and additional conditions which in particular imply that the number of leapfrog steps is equal to with positive probability, shows that the kernel associated with the HMC algorithm is irreducible. Under this condition, the proof is a direct consequence of the irreducibility of the MALA algorithm - a mixture of Markov kernels is irreducible as soon as one component of the mixture is irreducible; the irreducibility of MALA kernel has been established in ). Finally, [5, Proposition 3.7] shows that RHMC is irreducible under the condition that is at least quadratic. Note that Theorem 2 establishes irreducibility of HMC of sub-quadratic potential. However, leap-frog integrator is not numerically stable for lighter than Gaussian target density, therefore other kind of integrators should be used instead, see e.g. [10, Chapter VI].
(a) follows from Theorem 1 and Appendix A. (b) and (c) are straightforward applications of Theorem 2. ∎
Geometric ergodicity of HMC
The proof is postponed to Section 5.2.1. ∎
Assume 1 and 2. Let be such that for any , where
The proof is postponed to Section 5.2.2 ∎
We now derive sufficient conditions under which the condition (34) of Section 3 is satisfied.
It is easily checked that under 3, the results of Section 2 can be applied, i.e. satisfies 1(); see Section 5.2.4.
Condition 2 and 3 are satisfied by power functions . More generally, they are satisfied by -homogeneously quasiconvex functions with convex level sets outside a ball and by perturbations of such functions.
We say that a function is -homogeneous quasi-convex outside a ball of radius if the following conditions are satisfied:
is -homogeneously quasiconvex outside a ball of radius and .
For , .
The proof is postponed to Section 5.2.3. ∎
To show that the condition (34) of Section 3 is satisfied under 3, we rely on the following important result which implies that the probability of accepting a move goes to 1 as .
Assume 3 for some . Let .
The proof is postponed to Section 5.2.4. ∎
However, in the case , Section 3-(b) only implies that the HMC proposal is inward only if the step size is sufficiently small with respect to the number of leapfrog step , i.e. is of order . To relax this condition, we strengthen 3() by assuming that is a smooth perturbation of a quadratic function.
Note that it is straightforward to check that under 4, the conditions 1 and 2 hold.
The proof is postponed to Section 5.2.5. ∎
We now can establish the geometric ergodicity of the HMC sampler.
We finally consider the case where the number of leapfrog steps is a random variable independent of the current state.
Compared to , which establishes geometric ergodicity of the HMC kernel under an implicit assumption on the behaviour of the acceptance rate, our conditions are directly verifiable on the potential .
where is the duration parameter of the RHMC algorithm. Note that these conditions assumed that the target density is lighter than Gaussian. In comparison, our results can be applied to sub-quadratic potentials. In addition, it can be shown that HMC is not geometrically ergodic under (46) on the following example associated with the potential defined by (49) below.
The main difference with the setting of is that HMC has a acceptance/rejection step and the integrated acceptance ratio
Irreducibility for a class of iterative models
The claim follows from the differentiation theorem for measures, see [25, Theorem 7.14]. ∎
The following Corollary is a straightforward consequence of Theorem 12.
In the next proposition, we give examples of functions which satisfy 2.
We have now all the necessary results to prove Section 4.
Since and is Lipschitz with a Lipschitz constant which is uniformly bounded over the ball , is Lipschitz with bounded Lipschitz constant over this ball. Hence 2()-(i) holds.
Proofs
We prefaces the proofs of our main results by useful bounds on the position and the momentum in the intermediate steps of the leap-frog integration.
where , and and are defined by (12) and (19), respectively.
Second, similarly using (67), we have that
where we have used (71) for the last inequality. Summing up (71) and (72), we get the desired result for . ∎
Let and assume 1-(ii).
where and is defined by (12).
where is defined by (19) and
Therefore, (80) is satisfied which concludes the induction and the proof.
Second, similarly using (67), we get that
By a straightforward induction, we obtain that
where is defined in (78).
where is defined by (19).
For and , by Section 5-(ii), we have
It is a well known fact (see for example [9, Exercise 3.26]) that if
which implies by (109) and Section 5 that there exists satisfying
with the convention and
1.2 Proof of Theorem 2
which implies that the condition Section 4-(i) is satisfied. To check that condition Section 4-(ii) holds, we consider separately the two cases: and .
showing that condition (ii) of Section 4 is satisfied.
2 Proofs of Section 3
Note that by definition (32) of and
The proof then follows from combining this result and (122) since they imply
2.2 Proof of Section 3
Combining (136) and (141), and using that , we finally obtain that (134) holds.
which implies using Section 5, for any , and the dominated convergence theorem that
Then, Section 5 and the Fatou Lemma imply that
where is defined in (38). The proof follows.
2.3 Proof of Section 3
Finally using 1, we get that the set is convex.
To show 3-(ii), we check first that it is sufficient to prove that
Using (155) again and since is compact, we get that there exists such that . Hence by (158), we have
Thus 3-(ii) holds for . Finally 2 implies that the function satisfies 3-(ii) as well.
First consider . We next argue by contradiction that
Indeed assume that . Then by continuity of , we get that . But since , we get which is impossible since .
Then and by (163), . If , using 1 and (160), we get
In turn, if , since , by (161) and 1, and (165) still holds.
2.4 Proof of Section 3
We preface the proof by several technical preliminary Lemmas.
Plugging this result in (168) concludes the proof.
Assume 1 for . Let .
where is defined in (19).
where , and are defined in (19) and (78) respectively.
The proof is concluded by taking sufficiently small and sufficiently large. ∎
where is defined in (12), , and for .
Using the definition of , we get
First, Taylor’s formula with exact remainder enables us to write
Using that , with defined by (13), in (192) and (193), we get
Summing these equalities up and observing appropriate cancellations yields
By using again in the definition of each we obtain successively
Gathering all these equalities in (199) concludes the proof. ∎
We show that each term in the sum in the right hand side of this equation is nonpositive if is large enough and . By Section 5.2.4, we have
where, setting for ,
Hence, . We now bound . Using 3-(i), Section 5.2.4 and (222), we get by (215) that
Combining 3-(i), Section 5.2.4 and (222) again, we get by crude estimate that there exists such that
We finally bound the two terms and . First, using the same reasoning as for , we get that
Arguing like in (223), we get that . Gathering all these results and using that for and , we get that for all ,
Finally, arguing like in (231), we get that
Combining (231)-(232)-(233)-(234) and (235) in (208), and using that for , we get that for all ,
2.5 Proof of Section 3
The proof is concluded by using that is definite positive and taking sufficiently small and sufficiently large. ∎
We show below that there exists such that, for all and satisfying ,
Using that for , and (243), we obtain that for any and , , ,
Then, if for any , , , we get that
Similarly using that is definite positive, we obtain that there exist and such that if , for any , , , we get that
Combining (247)-(253)-(259)-(261) and (262) in (254), we obtain that (245) holds with since (243) implies that . ∎