MALA is a gradient-based MCMC method that samples complex high-dimensional distributions using discretized Langevin dynamics corrected by a Metropolis–Hastings step.
The algorithm exhibits distinct scaling laws: burn-in costs scale as O(N^(1/2)) while stationary exploration scales as O(N^(1/3)), ensuring efficient convergence.
Practical implementation of MALA involves adaptive tuning of the step size to maintain an optimal acceptance rate near 0.574 across both non-stationary and stationary regimes.
The Metropolis-Adjusted Langevin Algorithm (MALA) is a gradient-based Markov Chain Monte Carlo (MCMC) method designed for sampling from complex, high-dimensional target distributions with Lebesgue density on RN. MALA constructs a reversible Markov chain with respect to the prescribed target and achieves ergodic sampling via a proposal mechanism derived from discretized Langevin dynamics, corrected with a Metropolis–Hastings accept–reject step. Contemporary analyses of MALA focus extensively on computational complexity as a function of dimension, particularly regarding its distinct dynamics in non-stationary (burn-in) versus stationary phases. The key high-dimensional asymptotics, established for non-product and product targets alike, delineate the regimes in which optimal scaling and cost are achieved, revealing universal scaling laws for burn-in and for stationary exploration (Kuntz et al., 2016).
1. Algorithmic Formulation of MALA
Given a target density πN on RN, the MALA proposal is constructed as a single Euler–Maruyama (forward-Euler) discretization step of the overdamped Langevin SDE: y=x+2h∇logπN(x)+hZ,Z∼N(0,IN),
where h>0 serves as the proposal time step or variance. The associated Gaussian proposal density is
q(x,y)=(4πh)N/21exp{−4h1∥y−x−2h∇logπN(x)∥2}.
The acceptance probability for the Metropolis–Hastings adjustment is defined by
This formulation guarantees reversibility of the Markov chain with respect to πN, and hence, πN is invariant (Kuntz et al., 2016).
2. Diffusion-Limit Theory and Non-Stationary Regime
For non-stationary initialization (the "burn-in" phase), MALA exhibits fundamentally different asymptotic behavior compared to its stationary regime. Consider the continuous-time, piecewise-linear interpolation
πN0
and scale the proposal variance with dimension as πN1. As πN2, πN3 converges weakly (in suitable function-space topology) to the solution of an infinite-dimensional SDE coupled to a non-stationarity scalar ODE,
πN4
πN5
πN6
Here, πN7 is a cylindrical πN8-Brownian motion, and πN9, RN0 encode the (possibly non-product) target (Kuntz et al., 2016). This coupled system captures the evolution of the "empirical squared norm" RN1, measuring deviation from stationarity; RN2 monotonically, after which the SDE reduces to the ergodic infinite-dimensional Langevin diffusion.
The key non-stationary result is that, with this scaling RN3, MALA requires RN4 iterations to traverse an RN5 macroscopic time interval and to bring RN6 near equilibrium—the computational cost of burn-in thus scales as RN7 [(Kuntz et al., 2016), Theorem 5.1].
3. Optimal Scaling and Cost in Stationary and Non-Stationary Regimes
The optimal cost analysis relies on asymptotic expansions of the Metropolis log-acceptance ratio:
Non-stationary (burn-in) phase: The dominant term in RN8 satisfies
RN9
which is y=x+2h∇logπN(x)+hZ,Z∼N(0,IN),0 if and only if y=x+2h∇logπN(x)+hZ,Z∼N(0,IN),1. All higher-order terms y=x+2h∇logπN(x)+hZ,Z∼N(0,IN),2. Each MALA step increments time by y=x+2h∇logπN(x)+hZ,Z∼N(0,IN),3, so y=x+2h∇logπN(x)+hZ,Z∼N(0,IN),4 steps are required for y=x+2h∇logπN(x)+hZ,Z∼N(0,IN),5 macroscopic time—i.e., burn-in [(Kuntz et al., 2016), Lemmas 7.1–7.5].
Stationary regime: Once y=x+2h∇logπN(x)+hZ,Z∼N(0,IN),6, one has y=x+2h∇logπN(x)+hZ,Z∼N(0,IN),7 and the leading Taylor expansion yields
y=x+2h∇logπN(x)+hZ,Z∼N(0,IN),8
provided y=x+2h∇logπN(x)+hZ,Z∼N(0,IN),9. The stationary regime thus admits a nondegenerate h>00 limit for h>01 distributed as h>02, and sample acceptance h>03. The cost to make a macroscopic move in stationarity is h>04 steps [(Kuntz et al., 2016), Section 4].
This analysis yields universal cost laws for high-dimensional MALA: burn-in h>05, then stationary exploration h>06. These hold for both product and general non-product targets, provided mild spectral decay and Lipschitz conditions on h>07 (Kuntz et al., 2016).
4. Universality for Non-Product High-Dimensional Targets
The infinite-dimensional setting places MALA in the context of Hilbert space h>08 with reference Gaussian measure h>09. Targets are of the form
q(x,y)=(4πh)N/21exp{−4h1∥y−x−2h∇logπN(x)∥2}.0
with general nonlinear q(x,y)=(4πh)N/21exp{−4h1∥y−x−2h∇logπN(x)∥2}.1, q(x,y)=(4πh)N/21exp{−4h1∥y−x−2h∇logπN(x)∥2}.2, and covariance eigenvalues q(x,y)=(4πh)N/21exp{−4h1∥y−x−2h∇logπN(x)∥2}.3, q(x,y)=(4πh)N/21exp{−4h1∥y−x−2h∇logπN(x)∥2}.4. The Sobolev regularity, eigenvalue decay, and Lipschitz properties on q(x,y)=(4πh)N/21exp{−4h1∥y−x−2h∇logπN(x)∥2}.5 (as q(x,y)=(4πh)N/21exp{−4h1∥y−x−2h∇logπN(x)∥2}.6 map) ensure regularity of the algorithm and the validity of diffusion-limit theorems. Finite-dimensional approximations on q(x,y)=(4πh)N/21exp{−4h1∥y−x−2h∇logπN(x)∥2}.7 conduce to valid targets and theorems apply as long as the assumptions carry over (Kuntz et al., 2016).
This envelope encompasses important cases such as Bayesian inverse problems, nonparametric regression, and conditioned diffusions, extending MALA's high-dimensional theory far beyond product settings.
5. Practical Tuning: Acceptance Rate and Adaptive Schemes
Practical implications for high-dimensional MALA are direct:
Burn-in: Use q(x,y)=(4πh)N/21exp{−4h1∥y−x−2h∇logπN(x)∥2}.8 until the observable q(x,y)=(4πh)N/21exp{−4h1∥y−x−2h∇logπN(x)∥2}.9, i.e., until the chain approaches stationarity. This phase lasts α(x,y)=min{1,πN(x)q(x,y)πN(y)q(y,x)}=min{1,exp(QN(x,y))},0 steps.
Stationary exploration: Once α(x,y)=min{1,πN(x)q(x,y)πN(y)q(y,x)}=min{1,exp(QN(x,y))},1, switch to α(x,y)=min{1,πN(x)q(x,y)πN(y)q(y,x)}=min{1,exp(QN(x,y))},2; now each macroscopic move costs α(x,y)=min{1,πN(x)q(x,y)πN(y)q(y,x)}=min{1,exp(QN(x,y))},3 steps.
Optimal acceptance: In stationarity, maximize α(x,y)=min{1,πN(x)q(x,y)πN(y)q(y,x)}=min{1,exp(QN(x,y))},4 (where α(x,y)=min{1,πN(x)q(x,y)πN(y)q(y,x)}=min{1,exp(QN(x,y))},5) for the speed function; the theoretically optimal acceptance is α(x,y)=min{1,πN(x)q(x,y)πN(y)q(y,x)}=min{1,exp(QN(x,y))},6 at α(x,y)=min{1,πN(x)q(x,y)πN(y)q(y,x)}=min{1,exp(QN(x,y))},7 [(Kuntz et al., 2016), Section 6].
Step-size adaptation: In practice, estimate α(x,y)=min{1,πN(x)q(x,y)πN(y)q(y,x)}=min{1,exp(QN(x,y))},8 and adapt α(x,y)=min{1,πN(x)q(x,y)πN(y)q(y,x)}=min{1,exp(QN(x,y))},9 accordingly to maintain desired acceptance.
These scaling results provide robust guidance for choosing step sizes and monitoring acceptance rates in high-dimensional applications where explicit diagnostics of convergence/mixing are difficult.
6. Regime Recognition and Transition
The sharp distinction between non-stationary and stationary regimes is prominent:
Scaling the step size too aggressively (QN(x,y)=logπN(y)−logπN(x)−4h1∥y−x−2h∇logπN(x)∥2+4h1∥x−y−2h∇logπN(y)∥2.0) in stationary phase leads to degeneracy (QN(x,y)=logπN(y)−logπN(x)−4h1∥y−x−2h∇logπN(x)∥2+4h1∥x−y−2h∇logπN(y)∥2.1 only if QN(x,y)=logπN(y)−logπN(x)−4h1∥y−x−2h∇logπN(x)∥2+4h1∥x−y−2h∇logπN(y)∥2.2 exactly).
Using QN(x,y)=logπN(y)−logπN(x)−4h1∥y−x−2h∇logπN(x)∥2+4h1∥x−y−2h∇logπN(y)∥2.3 in non-stationary phase leads to divergence in QN(x,y)=logπN(y)−logπN(x)−4h1∥y−x−2h∇logπN(x)∥2+4h1∥x−y−2h∇logπN(y)∥2.4 if QN(x,y)=logπN(y)−logπN(x)−4h1∥y−x−2h∇logπN(x)∥2+4h1∥x−y−2h∇logπN(y)∥2.5 deviates appreciably from QN(x,y)=logπN(y)−logπN(x)−4h1∥y−x−2h∇logπN(x)∥2+4h1∥x−y−2h∇logπN(y)∥2.6.
Correctly identifying and adapting to these phases is essential for efficient high-dimensional MALA implementation; these scaling laws are universal for highly regular targets regardless of product structure (Kuntz et al., 2016).
The associated laws and optimal acceptance rates are derived from Taylor expansions and matched in stationarity by Gaussian approximation of the log-Metropolis increment (Kuntz et al., 2016).
References:
The foundational scaling and diffusion-limit results for non-stationary and stationary regimes appear in "Non-stationary phase of the MALA algorithm" (Kuntz et al., 2016). This work builds upon and significantly extends the analysis in (Pillai et al., 2011) and other infinite-dimensional scaling literatures.