---
title: Randomized Midpoint Langevin Monte Carlo
url: https://www.emergentmind.com/topics/randomized-midpoint-langevin-monte-carlo-rlmc
type: topic
---

# Randomized Midpoint Langevin Monte Carlo

Randomized Midpoint Langevin Monte Carlo (RLMC) is a class of stochastic numerical integrators for simulating Langevin diffusions to sample from high-dimensional distributions. Unlike classical Euler-based discretizations, RLMC achieves higher-order accuracy and improved computational complexity by randomizing the integration point within each time step. This scheme is particularly effective for strongly convex and log-concave targets, and recent analysis demonstrates its near-optimality in Wasserstein-2 and KL metrics under mild regularity assumptions.

## 1. Algorithm and Update Rule

At the core of RLMC lies a randomized midpoint update for discretizing the overdamped Langevin SDE:
$$
dX_t = -\nabla U(X_t) dt + \sqrt{2} dB_t
$$
for potential $U: \mathbb{R}^d \rightarrow \mathbb{R}$.

A single RLMC iteration proceeds as:
- Draw $u_k \sim \mathrm{Uniform}[0,1]$
- Draw independent Gaussian vectors $\xi_k', \xi_k \sim \mathcal{N}(0, I_d)$
- Compute the midpoint:
  $$
  Y_{k+u_k} = X_k - u_k \eta \nabla U(X_k) + \sqrt{2u_k \eta} \xi_k'
  $$
- Update:
  $$
  X_{k+1} = X_k - \eta \nabla U(Y_{k+u_k}) + \sqrt{2\eta} \xi_{k+1}
  $$

This scheme is a two-gradient-call modification of Unadjusted Langevin Algorithm (ULA). The randomization in the drift evaluation yields a mean-zero local discretization error, eliminating the leading order bias and de-correlating local errors across steps [2511.13093], [2306.08494].

## 2. Mathematical Foundations and Regularity

To guarantee geometric ergodicity and optimal error bounds, RLMC requires the potential $U$ to be $m$-strongly convex and $L$-gradient Lipschitz:
$$
m \|x-y\|^2 \le \langle \nabla U(x) - \nabla U(y), x-y \rangle \le L \|x-y\|^2 \quad \forall x,y,
$$
implying $m I_d \preceq \nabla^2 U(x) \preceq L I_d$. Additional regularity, such as bounded third derivatives, may be needed for sharper results and decreasing-step analysis [2511.13085], [2511.13093].

For generalization beyond log-concavity, analysis depends on:
- Dissipativity: $\langle x, \nabla U(x)\rangle \geq \mu |x|^2 - \mu' d$
- Gradient Lipschitzness
- Log-Sobolev Inequality (LSI) for the target measure $\pi$ [2509.25630]

## 3. Convergence Rates and Error Bounds

### Constant Step Size
With a fixed $\eta$, RLMC defines a homogeneous Markov chain with unique invariant measure $\pi_\eta$ and exponential convergence in weighted total variation:
$$
d_{TV,V}(\nu Q_\eta^n, \pi_\eta) \leq C(1+\nu(V))e^{-cn}
$$
where $V(x) = 1 + |x|^2$ [2511.13093].

The stationary bias relative to the true target $\pi$ satisfies:
$$
W_2(\pi_\eta, \pi) = O(\sqrt{\eta}) \quad \text{(overdamped)}
$$
and can be sharpened to $O(\eta)$ under third-derivative control [2511.13085].

### Decreasing Step Size
With a nonincreasing sequence $\{\gamma_k\}$, RLMC achieves
$$
d_{\mathcal{G}}(\mathcal{L}(Y_{t_n}), \pi) \leq C(1+|x|^2)\gamma_n
$$
in test-function metrics, and $O(\gamma_n)$ rates in $W_2$ for sufficiently smooth $U$ [2511.13085], [2511.13093].

### KL and Total Variation Complexity
Applying Malliavin calculus and anticipative Girsanov arguments, RLMC achieves near-optimal query complexity for $\varepsilon^2$-accurate KL error:
$$
\widetilde{O}(\kappa^{5/4} d^{1/4} \varepsilon^{-1/2})
$$
where $\kappa = L/m$ is the condition number. This matches or surpasses the best previously known rates, breaking the $\widetilde{O}(\kappa^2 d \varepsilon^{-2})$ barrier of Euler-type methods [2507.12791].

## 4. Randomized Midpoint and Poisson Variants

### Randomized Midpoint
RLMC uses a single uniform random point per step to evaluate the drift, producing higher weak order accuracy (bias $O(h^2)$, variance $O(h^3)$) than deterministic midpoint or Euler methods [1909.05503], [2306.08494]:
- Overdamped: $O(h^{1/2})$ bias
- Underdamped: $O(h^{3/2})$ bias [2011.03176], [2003.09906]

### Poisson Randomized Midpoint LMC (PRLMC)
PRLMC introduces a Poisson-distributed number of random midpoints (Bernoulli or uniform selection over $K$ midpoints per interval) to further debias the integrated drift. As $K \to \infty$, PRLMC approaches a true Poisson randomization, producing unbiased step corrections and potentially lower discretization bias [2511.13085], [2405.17068].

### Parallelization
Splitting intervals into $R$ subintervals, parallelized RLMC (pRLMC) aggregates $R$ independent midpoint tasks per iteration. This architecture enables significant wall-clock speedup without impacting convergence rates, particularly valuable in high-dimensional settings [2402.14434].

## 5. Nonasymptotic Analysis and Practical Implications

Recent advances established tight nonasymptotic bounds for RLMC and PRLMC in various metrics under minimal smoothness:

- Wasserstein-2 rates of $O(\sqrt{d}\,h)$ or $O(d^{\theta}h)$ for projected/tamed variants without global Lipschitzness [2509.25630]
- Query complexity $O(\kappa^{4/3} \epsilon^{-2/3})$ or $O(\kappa \log(1/\varepsilon))$ in $W_2$ for strongly convex problems [2306.08494], [2402.14434]
- Rigorous confidence intervals for statistical estimates via CLTs [2011.03176]
- Empirical superiority in convergence versus ULA and deterministic midpoint, particularly for diffusion model sampling and score-based generative models [2405.17068]

## 6. Comparison with Other Langevin Integrators

| Method         | Complexity (KL/$W_2$)         | Bias Order        |
|----------------|-------------------------------|-------------------|
| ULA/Euler      | $\widetilde{O}(\kappa^2 d \varepsilon^{-2})$ | $O(h)$           |
| RLMC           | $\widetilde{O}(\kappa^{5/4} d^{1/4} \varepsilon^{-1/2})$ | $O(h^{1/2})$ (overdamped) |
| PRLMC (Poisson)| $\widetilde{O}(\kappa \log(1/\varepsilon))$ (W$_2$) | $O(h^{3/2})$ (underdamped) |
| Verlet+Midpoint| $\widetilde{O}(\kappa^{3/2} \epsilon^{-2/3})$ | $O(h^{3/2})$     |
| Parallel RLMC  | $O(\kappa \log(1/\varepsilon))$ wall-clock time | $O(h^{1/2})$    |

RLMC and its Poisson and parallel variants offer quantifiable improvements in strong and weak error rates, dimensional scaling, and practical runtime, especially compared to Euler–Maruyama and deterministic midpoint schemes [2507.12791], [2011.03176], [2402.14434].

## 7. Open Directions and Extensions

Ongoing research explores RLMC under nonconvexity, with dissipativity and LSI replacing log-concavity [2509.25630], extension to manifold Langevin sampling, and analysis in statistical inference tasks where ergodicity and higher-order bias impact sample quality. Further generalizations involve tamed and projected variants for unbounded drifts, and double-midpoint constructions for kinetic Langevin dynamics requiring third-order regularity.

Recent results point towards RLMC as an optimal integrator for a range of stochastic sampling problems, with minimal assumptions and strong complexity guarantees, bridging theoretical advances with empirical acceleration in applications to high-dimensional Bayesian inference and generative modeling [2511.13085], [2405.17068].

Source: https://www.emergentmind.com/topics/randomized-midpoint-langevin-monte-carlo-rlmc