Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm
Alain Durmus, Eric Moulines
Introduction
where is a -dimensional Brownian motion. It is well-known that the Markov semi-group associated with the Langevin diffusion is reversible w.r.t. . Under suitable conditions, the convergence to takes place at geometric rate. Precise quantitative estimates of the rate of convergence with explicit dependency on the dimension of the state space have been recently obtained using either functional inequalities such as Poincaré and log-Sobolev inequalities (see ) or by coupling techniques (see ). The Euler-Maruyama discretization scheme associated to the Langevin diffusion yields the discrete time-Markov chain given by
where is an i.i.d. sequence of standard Gaussian -dimensional random vectors and is a sequence of step sizes, which can either be held constant or be chosen to decrease to . The idea of using the Markov chain to sample approximately from the target has been first introduced in the physics literature by and popularised in the computational statistics community by and . It has been studied in depth by , which proposed to use a Metropolis-Hastings step at each iteration to enforce reversibility w.r.t. leading to the Metropolis Adjusted Langevin Algorithm (MALA). They coin the term unadjusted Langevin algorithm (ULA) when the Metropolis-Hastings step is skipped.
The purpose of this paper is to study the convergence of the ULA algorithm. The emphasis is put on non-asymptotic computable bounds; we pay a particular attention to the way these bounds scale with the dimension and constants characterizing the smoothness and curvature of the potential . Our study covers both constant and decreasing step sizes and we analyse both the ”finite horizon” (where the total number of simulations is specified before running the algorithm) and ”any-time” settings (where the algorithm can be stopped after any iteration).
When the step size is constant, under appropriate conditions (see ), the Markov chain is -uniformly geometrically ergodic with a stationary distribution . With few exceptions, the stationary distribution is different from the target . If the step size is small enough, then the stationary distribution of this chain is in some sense close to . We provide non-asymptotic bounds of the -total variation distance between and , with explicit dependence on the step size and the dimension . Our results complete and extend the recent works by and .
When decreases to zero, then is a non-homogeneous Markov chain. If in addition , we show that the marginal distribution of this non-homogeneous chain converges, under some mild additional conditions, to the target distribution , and provide explicit bounds for the convergence. Compared to the related works by , , and , we establish not only the weak convergence of the weighted empirical measure of the path to the target distribution but a much stronger convergence in total variation, similarly to , where the strongly log-concave case is considered.
The paper is organized as follows. In Section 2, the main convergence results are stated under abstract assumptions. We then specialize in Section 3 these results to different classes of densities. The proofs are gathered in Section 4. Some general convergence results for diffusions based on reflection coupling, which are of independent interest, are stated in Section 5.
General conditions for the convergence of ULA
In this section, we derive a bound on the convergence of the ULA to the target distribution when the Langevin diffusion is geometrically ergodic and the Markov kernel associated with the EM discretization satisfies a Foster-Lyapunov drift inequality.
Consider the following assumption on the potential :
By [35, Theorem 2.2], if in (4) is a non-empty compact set, then the Langevin diffusion is geometrically ergodic.
Consider now the EM discretization of the diffusion (2). Let be a sequence of positive and nonincreasing step sizes and for , denote by
Note that Section 2 implies that where
To control the first term on the right hand side, we use a method introduced in and elaborated in . The second term is bounded using the convergence of the semi-group to , see (3).
where are defined in (3) and
Girsanov’s Theorem [21, Theorem 5.1, Corollary 5.16, Chapter 3] shows that and are mutually absolutely continuous and in addition, -almost surely
and , where is defined in (11).
, and .
There exists such that for all , and . Therefore, we can define for all ,
and . We first show that . The proof goes by contradiction. If we could extract a bounded subsequence . For such sequence, is bounded away from , but which yields to a contradiction. The definition of implies that , showing that
The proof follows from (10) using .
which shows that the first term in the right side of (10) goes to as goes to infinity. As for the second term, since , we get using that is nonincreasing and ,
Using and , we have , which concludes the proof.
For , set . Then using the stated expressions of and in (10) concludes the proof. ∎
Note that an upper bound for defined in (17) is . The dependency of on the dimension will be addressed in Section 3.
The proof is a straightforward calculation using (10). ∎
Practical conditions for geometric ergodicity of the Langevin diffusion and their consequences for ULA
Assume first that the potential is superexponential outside a ball. This is a rather weak assumption (we do not assume convexity here).
The price to pay will be constants which are exponential in the dimension. Under H 1, the potential is unbounded off compact set. Since is continuous, it has a global minimizer , which is a point at which . Without loss of generality, it is assumed that .
The elementary proof is postponed to Section 4.2. ∎
Following [35, Theorem 2.3], we first establish a drift condition for the diffusion.
The proof, adapted from [35, Theorem 2.3] and [31, Theorem 6.1], is postponed to Section 4.3. ∎
Under H 1, explicit expressions for and have been developed in the literature but these estimates are in general very conservative. We now turn to establish (6) for the Euler discretization.
where , are given by Section 3.1, by (7), , , in Section 3.1, by (8), in (18).
where , are defined in Section 3.1, in Section 3.1, in (8) and
Moreover, has a unique invariant distribution and
Note that Theorem 2 implies that there exists a constant which does not depend on such that .
for some , , for some constants and , which does not depend on .
This inequality implies by [9, Theorem 2.1] that for all and any initial distribution , such that ,
[2, Theorem 1.4] shows that if the Lyapunov condition (4) is satisfied, then the Poincaré inequality (21) holds with an explicit constant. Denote by
where is the Gamma function and the constants are given in Section 3.1 and (18) respectively.
2 Log-concave densities
We now consider the following additional assumption.
We now derive a drift inequality for under H 2.
If is convex, [5, Theorem 1.2] shows that satisfies a Poincaré inequality with a constant depending only on the variance of .
The proof is postponed to Section 4.10. ∎
where is the cumulative distribution function of the standard Gaussian distribution and is the associated quantile function. Before stating the theorem, we first show that (4) holds and provide explicit expressions for the constants which come into play. These constants will be used to obtain the explicit convergence rate of the semigroup to which is derived in Theorem 5.
The proof is adapted from [2, Corollary 1.6] and is postponed to Section 4.11. ∎
Note that the bound, we obtain is a little different from (3). The initial condition is isolated on purpose to get a better bound. A consequence of this result is the following bound on the convergence of the sequence to .
where , are given by (27) and (30a) respectively and
Finally the proof follows the same line as the one of Section 2. ∎
Note that this condition implies that the variance of is upper bounded by .
3 Strongly log-concave densities
More precise bounds can be obtained in the case where is assumed to be strongly convex outside some ball; this assumption has been considered by for convergence in the Wasserstein distance; see also .
The proof is postponed to Section 4.12. ∎
Using the inequalities for all , and for all , , we have:
4 Bounded perturbation of strongly log-concave densities
We now consider the case where is a bounded perturbation of a strongly convex potential.
The potential may be expressed as , where
Denote by the minimizer of .
The proof is postponed to Section 4.13. ∎
The proof is postponed to Section 4.14. ∎
Proofs
The proof is then completed using this inequality in (34).
2 Proof of Section 3.1
On the other hand using again L 1, the Cauchy-Schwarz inequality and , for all ,
3 Proof of Section 3.1
4 Proof of Section 3.1
By H 1, for all ,
The proof is completed combining the last inequality and (37).
5 Proof of Theorem 1
where . Using that for all , and Section 2, we get
Eq. (19) follows from Section 3.1, Section 3.1 and Section 2.
6 Proof of Theorem 2
Using (38) and the Cauchy-Schwarz inequality in the previous inequality concludes the proof. ∎
First note that by the triangle inequality and Section 3.1, for all
Finally, can be bounded along the same lines. ∎
7 Proof of Theorem 3
where .
Then, the proof of the claimed inequality is by induction. By (43), the inequality holds for . Now assume that it holds for . By induction hypothesis and (43) applied for , we have
Rearranging terms in the last inequality concludes the proof. ∎
Then the proof is concluded by a straightforward calculation. ∎
We bound the two terms of the right hand side of (10). The first term is dealt with the same reasoning as for the proof of Theorem 1. Regarding the second term, by [2, Theorem 1.4], satisfies a Poincaré inequality with constant . Then, the claimed bound follows from (22) and Section 4.7. ∎
8 Proof of Section 3.2
9 Proof of Section 3.2
The proof is then completed using Section 3.2, Section 2 and that is one-to-one with for all , . ∎
Using , L 1 and Section 4.9, we have for all ,
10 Proof of Theorem 4
Then the proof is concluded using the spherical coordinates. ∎
By [5, Theorem 1.2], satisfies a Poincaré inequality with constant . Therefore, the second term in (10) is dealt as in the proof of Theorem 3 using (22), Section 4.10 and Section 4.7. ∎
11 Proof of Section 3.2
12 Proof of Section 3.3
13 Proof of Section 3.4
Using this inequality and in (49) concludes the proof. ∎
Consider the second term in the right hand side of (50). Since , and is nonincreasing, and therefore:
14 Proof of Theorem 7
We preface the proof of the Theorem by a preliminary lemma.
Plugging this bound in (51) gives the desired result. ∎
Quantitative convergence bounds in total variation for diffusions
In this part, we derived quantitative convergence results in total variation norm for -dimensional SDEs of the form
with for and otherwise. Define the coupling time
For , is the solution of the SDE
where we have used the reflection principle in the last identity. ∎
For , define recursively the -th return time to delayed by by
Then by the Dynkin formula (see e.g. [32, Eq. (8)]) the process
The result then follows from this inequality and the strong Markov property. ∎
For the second term, using Section 5 and the Markov inequality, we get
More precise bounds can be obtained under more stringent assumption on the drift ; see and .
Consider the sequence of increasing stopping time
is a positive supermartingale and by the optional stopping theorem, we get
For the second term, using Section 5-(b) and the Markov inequality, we get
By applying Theorem 9 with , the triangle inequality and using that is invariant for , we have
Acknowledgements
The authors are indebted to Arnaud Guillin for sharing his knowledge of Poincaré and log-Sobolev inequalities. The authors are grateful to Andreas Eberle for very careful readings and many useful comments. The author thank the anonymous referees for their constructive feedback. The work of A.D. and E.M. is supported by the Agence Nationale de la Recherche, under grant ANR-14-CE23-0012 (COSMOS).