Metropolis-adjusted Langevin algorithm explained

In computational statistics, the Metropolis-adjusted Langevin algorithm (MALA) or Langevin Monte Carlo (LMC) is a Markov chain Monte Carlo (MCMC) method for obtaining random samples – sequences of random observations – from a probability distribution for which direct sampling is difficult. As the name suggests, MALA uses a combination of two mechanisms to generate the states of a random walk that has the target probability distribution as an invariant measure:

• new states are proposed using (overdamped) Langevin dynamics, which use evaluations of the gradient of the target probability density function;
• these proposals are accepted or rejected using the Metropolis–Hastings algorithm, which uses evaluations of the target probability density (but not its gradient).

Informally, the Langevin dynamics drive the random walk towards regions of high probability in the manner of a gradient flow, while the Metropolis–Hastings accept/reject mechanism improves the mixing and convergence properties of this random walk. MALA was originally proposed by Julian Besag in 1994,^[1] (although the method Smart Monte Carlo was already introduced in 1978 ^[2]) and its properties were examined in detail by Gareth Roberts together with Richard Tweedie^[3] and Jeff Rosenthal.^[4] Many variations and refinements have been introduced since then, e.g. the manifold variant of Girolami and Calderhead (2011).^[5] The method is equivalent to using the Hamiltonian Monte Carlo (hybrid Monte Carlo) algorithm with only a single discrete time step.

Further details

Let

\pi denote a probability density function on R ^{d} , one from which it is desired to draw an ensemble of independent and identically distributed samples. We consider the overdamped Langevin Itô diffusion• X = \nabla log \pi(X) + \sqrt{ 2 } • W W . (Note that another commonly-used normalization for this diffusion is• X = (1)/(2) \nabla log \pi(X) + • W ,

which generates the same dynamics.) In the limit as

t \to inf ty , this probability distribution \rho(t) of X(t) approaches a stationary distribution, which is also invariant under the diffusion, which we denote \rho _{infty} . It turns out that, in fact, \rho _{infty} = \pi .

Approximate sample paths of the Langevin diffusion can be generated by many discrete-time methods. One of the simplest is the Euler–Maruyama method with a fixed time step

\tau > 0 . We set X _{0} : = x _{0} and then recursively define an approximation X _{k} to the true solution X(k \tau) byX _{k} : = X _{k} + \tau \nabla log \pi(X _{k)} + \sqrt{ 2 \tau} \xi _{k,}

where each

\xi _{k} is an independent draw from a multivariate normal distribution on R ^{d} with mean 0 and covariance matrix equal to the d x d identity matrix. Note that X _{k} is normally distributed with mean X _{k} + \tau \nabla log \pi(X _{k)} and covariance equal to 2 \tau times the d x d identity matrix.

In contrast to the Euler–Maruyama method for simulating the Langevin diffusion, which always updates

X _{k} according to the update ruleX _{k} : = X _{k} + \tau \nabla log \pi(X _{k)} + \sqrt{ 2 \tau} \xi _{k,}

MALA incorporates an additional step. We consider the above update rule as defining a proposal

\tilde{X} _{k} for a new state,\tilde{X} _{k} : = X _{k} + \tau \nabla log \pi(X _{k)} + \sqrt{ 2 \tau} \xi _{k.}

This proposal is accepted or rejected according to the Metropolis-Hastings algorithm: set

\alpha : = min \left\{ 1 , (\pi(\tilde{X)/(_{k}) ) q(X _{k} \mid\tilde{X} _{k} )}{\pi({X} _{k} ) q(\tilde{X} _{k} \mid X _{k)}} \right\},

where

q(x'\mid x) \propto \exp \left( - (1)/(4 \tau) \| x' - x - \tau \nabla log \pi(x) \| ^{2} _{2} \right)

is the transition probability density from

x to x' (note that, in general q(x'\mid x) ≠ q(x\mid x') ). Let u be drawn from the continuous uniform distribution on the interval [ 0 , 1 ] . If u \leq \alpha , then the proposal is accepted, and we set X _{k} : = \tilde{X} _{k} ; otherwise, the proposal is rejected, and we set X _{k} : = X _{k} .

The combined dynamics of the Langevin diffusion and the Metropolis–Hastings algorithm satisfy the detailed balance conditions necessary for the existence of a unique, invariant, stationary distribution

\rho _{infty} = \pi . Compared to naive Metropolis–Hastings, MALA has the advantage that it usually proposes moves into regions of higher \pi probability, which are then more likely to be accepted. On the other hand, when \pi is strongly anisotropic (i.e. it varies much more quickly in some directions than others), it is necessary to take 0 < \tau \ll 1 in order to properly capture the Langevin dynamics; the use of a positive-definite preconditioning matrix A \in R ^{d} can help to alleviate this problem, by generating proposals according to\tilde{X} _{k} : = X _{k} + \tau A \nabla log \pi(X _{k)} + \sqrt{ 2 \tau A} \xi _{k,} so that \tilde{X} _{k} has mean X _{k} + \tau A \nabla log \pi(X _{k)} and covariance 2 \tau A .

For limited classes of target distributions, the optimal acceptance rate for this algorithm can be shown to be

0 . 574 ; if it is discovered to be substantially different in practice, \tau should be modified accordingly.

References

1. J. Besag. Comments on "Representations of knowledge in complex systems" by U. Grenander and MI Miller. Journal of the Royal Statistical Society, Series B. 1994. 56. 591 - 592.
2. Rossky . P.J. . Doll . J.D. . Friedman . H.L. . Brownian Dynamics as smart Monte Carlo simulation . Journal of Chemical Physics . 1978 . 69 . 10 . 4628. 10.1063/1.436415 . 1978JChPh..69.4628R .
3. G. O. Roberts and R. L. Tweedie. Exponential convergence of Langevin distributions and their discrete approximations. Bernoulli. 1996. 2. 4. 341 - 363. 10.2307/3318418. 3318418.
4. G. O. Roberts and J. S. Rosenthal. Optimal scaling of discrete approximations to Langevin diffusions. Journal of the Royal Statistical Society, Series B. 1998. 60. 1. 255 - 268. 10.1111/1467-9868.00123. 5831882.
5. M. Girolami and B. Calderhead. Riemann manifold Langevin and Hamiltonian Monte Carlo methods. Journal of the Royal Statistical Society, Series B. 2011. 73. 2. 123 - 214. 10.1111/j.1467-9868.2010.00765.x. 10.1.1.190.580.