Kinetic Langevin Monte Carlo

• KLMC is an underdamped Monte Carlo algorithm that augments position with velocity to sample Gibbs distributions via momentum-driven dynamics.
• It employs exact integration of the Ornstein–Uhlenbeck process and advanced splitting methods for improved discretization accuracy and convergence.
• Nonasymptotic convergence theory and extensions to non-strongly convex and Lie-group settings demonstrate its versatility and practical efficiency.

Kinetic Langevin Monte Carlo (KLMC), also called underdamped or kinetic Langevin Monte Carlo, is a class of Monte Carlo algorithms obtained by discretizing the kinetic Langevin diffusion, an underdamped Langevin system on position–velocity space whose invariant law has Gibbs form and whose position marginal is the target distribution (Dalalyan et al., 2018). In the standard Euclidean formulation, the target density is $\pi(x)\propto e^{-f(x)}$, the method augments $x$ with a velocity variable $v$, and the dynamics combine inertial transport, linear friction, and Gaussian noise injected into the velocity equation rather than directly into position space (Wang et al., 31 Aug 2025). Subsequent work has developed KLMC in several directions: nonasymptotic $W_2$ theory for smooth strongly log-concave targets, convexification-based extensions to merely log-concave targets, higher-order and splitting discretizations, structure-preserving formulations on Lie groups, and specialized variants for latent-variable inference, random regime switching, and unbiased estimation with inexact gradients (Dalalyan et al., 2019).

1. Continuous-time formulation and invariant measure

In its standard form, the kinetic Langevin diffusion evolves according to

$$dV_t=-\gamma V_t\,dt-\nabla f(X_t)\,dt+\sqrt{2\gamma}\,dB_t,\qquad dX_t=V_t\,dt,$$

with friction coefficient $\gamma>0$ and Brownian motion acting only on the velocity variable (Wang et al., 31 Aug 2025). The corresponding invariant law on phase space is

$\pi(v,x)\propto e^{-f(x)-\frac12\|v\|^2},$

more precisely $\mathcal N(0,I_d)\otimes \pi$, where $\pi(x)\propto e^{-f(x)}$ is the position marginal (Wang et al., 31 Aug 2025).

This formulation is the defining structural distinction between KLMC and overdamped Langevin Monte Carlo. Overdamped Langevin evolves directly in position space, whereas KLMC introduces momentum and therefore a second-order dynamics. In the Euclidean setting, the underdamped structure is described in the literature as adding momentum and making the dynamics nonreversible; the friction damps momentum while calibrating the Gaussian noise so that the Gibbs law remains invariant (Wang et al., 31 Aug 2025). A recurring interpretation is that underdamped dynamics can transport mass ballistically in the position variable instead of relying only on local diffusion (Wang et al., 31 Aug 2025).

A central early result is the geometric mixing analysis of the continuous-time diffusion for smooth strongly log-concave targets. Under

$mI_p\preceq \nabla^2 f(x)\preceq MI_p,$

the position marginal contracts exponentially in $x$0; in particular, if $x$1, then

$x$2

(Dalalyan et al., 2018). That contraction estimate became a basic ingredient in subsequent KLMC discretization analyses.

2. Discretization principles and core algorithms

A standard KLMC discretization is not the naive Euler discretization of the second-order SDE. The classical construction freezes the gradient over a time step and integrates the resulting linear Ornstein–Uhlenbeck system exactly. With

$x$3

the update takes the form

$x$4

where the Gaussian perturbations have covariance determined by the exact integrated Ornstein–Uhlenbeck part (Dalalyan et al., 2018). This matrix-exponential structure is one of the defining algorithmic signatures of KLMC.

A second line of development replaces first-order freezing of the force by higher-order local models. In the strongly convex Euclidean setting, KLMC2 uses Hessian information through

$x$5

and auxiliary functions $x$6, yielding a second-order kinetic discretization with a smaller discretization floor in Wasserstein distance (Dalalyan et al., 2018). In the convex but not strongly convex setting, the same first-order and second-order distinction reappears after strong convexification of the potential (Dalalyan et al., 2019).

A complementary viewpoint treats KLMC as a splitting method. One paper writes the kinetic Langevin diffusion as a Lie–Trotter splitting between a deterministic Hamiltonian flow and an Ornstein–Uhlenbeck velocity refreshment step

$x$7

and then improves the Hamiltonian subflow discretization using randomized Runge–Kutta–Nyström integrators (Bou-Rabee et al., 2023). That work introduces $x$8- and $x$9-order $v$0-accurate randomized Runge–Kutta–Nyström methods, establishes quantitative $v$1-order $v$2-accuracy upper bounds, and uses the resulting chain as an unadjusted KLMC sampler (Bou-Rabee et al., 2023).

Another important discretization family is the stochastic exponential Euler discretization, or exponential integrator. In this scheme the velocity damping is treated exactly and the nonlinear force is frozen over each step. A refined analysis later showed that this exponential integrator remains well behaved not only in the usual underdamped regime but also all the way to the overdamped limit, provided one applies the correct time acceleration (Kim et al., 4 Oct 2025).

3. Nonasymptotic convergence theory

The basic nonasymptotic KLMC guarantee for smooth strongly log-concave targets is a two-term Wasserstein bound combining geometric decay from initialization and a discretization floor. Under

$v$3

the law $v$4 of the KLMC position iterate satisfies

$v$5

(Dalalyan et al., 2018). With $v$6, the resulting iteration complexity improves prior underdamped analyses in its dependence on the condition number $v$7 (Dalalyan et al., 2018).

When Hessian Lipschitzness is available,

$v$8

KLMC2 replaces the first-order discretization floor by an $v$9-scale floor. Under explicit step-size restrictions, the law $W_2$0 satisfies

$W_2$1

(Dalalyan et al., 2018). In the regime where $W_2$2 and $W_2$3 are bounded and $W_2$4 is bounded away from $W_2$5, the paper states that KLMC2 achieves precision $W_2$6 in $W_2$7 iterations, up to logarithmic factors (Dalalyan et al., 2018).

The later analysis of the exponential integrator sharpened this picture rather than changing the algorithmic object. For the phase-space weighted norm

$W_2$8

it established a contraction

$W_2$9

under weaker parameter restrictions than previous work (Kim et al., 4 Oct 2025). The same paper also derived asymptotic bias bounds for the invariant measure $$dV_t=-\gamma V_t\,dt-\nabla f(X_t)\,dt+\sqrt{2\gamma}\,dB_t,\qquad dX_t=V_t\,dt,$$0 of the discretized chain, and showed that in the overdamped scaling $$dV_t=-\gamma V_t\,dt-\nabla f(X_t)\,dt+\sqrt{2\gamma}\,dB_t,\qquad dX_t=V_t\,dt,$$1, $$dV_t=-\gamma V_t\,dt-\nabla f(X_t)\,dt+\sqrt{2\gamma}\,dB_t,\qquad dX_t=V_t\,dt,$$2, $$dV_t=-\gamma V_t\,dt-\nabla f(X_t)\,dt+\sqrt{2\gamma}\,dB_t,\qquad dX_t=V_t\,dt,$$3, both the contraction rate and the bias converge to the corresponding overdamped LMC behavior (Kim et al., 4 Oct 2025). This directly counters the earlier impression that the exponential integrator degenerates in the overdamped regime.

One persistent point in the literature is that KLMC does not uniformly dominate overdamped LMC. The strongly log-concave analysis explicitly states that KLMC is preferable when $$dV_t=-\gamma V_t\,dt-\nabla f(X_t)\,dt+\sqrt{2\gamma}\,dB_t,\qquad dX_t=V_t\,dt,$$4 is large relative to $$dV_t=-\gamma V_t\,dt-\nabla f(X_t)\,dt+\sqrt{2\gamma}\,dB_t,\qquad dX_t=V_t\,dt,$$5, whereas LMC can be preferable when $$dV_t=-\gamma V_t\,dt-\nabla f(X_t)\,dt+\sqrt{2\gamma}\,dB_t,\qquad dX_t=V_t\,dt,$$6 is very large (Dalalyan et al., 2018). This is a methodological comparison, not a defect of the theory: the gain from momentum is accompanied by its own parameter sensitivity.

4. Extensions beyond the classical strongly log-concave Euclidean setting

A substantial extension concerns smooth log-concave targets that are not necessarily strongly log-concave. One paper analyzes KLMC in this regime by replacing the original potential $$dV_t=-\gamma V_t\,dt-\nabla f(X_t)\,dt+\sqrt{2\gamma}\,dB_t,\qquad dX_t=V_t\,dt,$$7 with the strongly convex surrogate

$$dV_t=-\gamma V_t\,dt-\nabla f(X_t)\,dt+\sqrt{2\gamma}\,dB_t,\qquad dX_t=V_t\,dt,$$8

with corresponding density $$dV_t=-\gamma V_t\,dt-\nabla f(X_t)\,dt+\sqrt{2\gamma}\,dB_t,\qquad dX_t=V_t\,dt,$$9, and then decomposing the error into a strongly convex KLMC term plus the surrogate bias between $\gamma>0$0 and $\gamma>0$1 (Dalalyan et al., 2019). A basic bound is

$\gamma>0$2

for $\gamma>0$3, with $\gamma>0$4 and $\gamma>0$5 (Dalalyan et al., 2019). This strong-convexification trick is the backbone of the non-strongly log-concave theory for both KLMC and KLMC2.

The resulting $\gamma>0$6-KLMC bound has the standard three-term form: finite-time error, discretization error, and convexification bias. For $\gamma>0$7, under explicit restrictions on $\gamma>0$8, $\gamma>0$9, and $\pi(v,x)\propto e^{-f(x)-\frac12\|v\|^2},$0,

$\pi(v,x)\propto e^{-f(x)-\frac12\|v\|^2},$1

(Dalalyan et al., 2019). Under the paper’s scale-adapted Wasserstein complexity notion, this yields polynomial dependence on the dimension.

A more geometric extension places KLMC on compact Lie groups. There the target on the group is

$\pi(v,x)\propto e^{-f(x)-\frac12\|v\|^2},$2

and left trivialization identifies $\pi(v,x)\propto e^{-f(x)-\frac12\|v\|^2},$3 with $\pi(v,x)\propto e^{-f(x)-\frac12\|v\|^2},$4, so the momentum variable lives in a fixed Euclidean Lie algebra $\pi(v,x)\propto e^{-f(x)-\frac12\|v\|^2},$5 (Kong et al., 2024). The resulting invariant Gibbs law is

$\pi(v,x)\propto e^{-f(x)-\frac12\|v\|^2},$6

(Kong et al., 2024). This framework gives a structure-preserving discretization that updates the group element by

$\pi(v,x)\propto e^{-f(x)-\frac12\|v\|^2},$7

on matrix Lie groups, preserves the manifold exactly, and proves exponential convergence in Wasserstein distance under compactness of the Lie group and geodesically $\pi(v,x)\propto e^{-f(x)-\frac12\|v\|^2},$8-smoothness of the potential function, without assuming convexity, geodesic convexity, log-concavity, or explicit isoperimetric inequalities (Kong et al., 2024).

These two extensions show that the phrase “KLMC theory” no longer refers only to Euclidean smooth strongly log-concave sampling. In the convex but not strongly convex Euclidean setting the key device is surrogate strong convexity; on compact Lie groups the key device is left trivialization and a custom semimetric rather than convexity.

5. Variant families and problem-specific generalizations

Several recent variants enlarge the KLMC design space while preserving the underdamped Gibbs target.

Variant	Defining feature	Representative source
KLMC2	Second-order kinetic scheme using Hessian information	(Dalalyan et al., 2018)
RS-KLMC	KLMC with random step sizes $\pi(v,x)\propto e^{-f(x)-\frac12\|v\|^2},$9	(Wang et al., 31 Aug 2025)
FRS-KLMC	KLMC with random friction coefficients $\mathcal N(0,I_d)\otimes \pi$0	(Wang et al., 31 Aug 2025)
KIPLMC	Latent-variable/interacting-particle extension of KLMC	(Oliva et al., 2024)
Lie-group KLMC	Structure-preserving kinetic Langevin sampler on compact Lie groups	(Kong et al., 2024)

The regime-switching variants randomize either the effective step scale or the friction through a finite-state continuous-time Markov chain. In RS-KLMC, the regime process multiplies the whole physical time scale, so the only algorithmic change relative to vanilla KLMC is that the effective step becomes random: $\mathcal N(0,I_d)\otimes \pi$1 (Wang et al., 31 Aug 2025). In FRS-KLMC, the physical step is fixed and the friction coefficient becomes a finite-state Markov chain. Both preserve the same Gibbs target, and both come with non-asymptotic $\mathcal N(0,I_d)\otimes \pi$2 guarantees whose rates depend on spectral quantities such as $\mathcal N(0,I_d)\otimes \pi$3 and $\mathcal N(0,I_d)\otimes \pi$4 (Wang et al., 31 Aug 2025).

A conceptually different generalization is Kinetic Interacting Particle Langevin Monte Carlo for maximum marginal likelihood estimation in latent variable models. Its central idea is to turn MMLE into sampling from an interacting underdamped diffusion whose stationary $\mathcal N(0,I_d)\otimes \pi$5-marginal concentrates around the MMLE as the number of particles $\mathcal N(0,I_d)\otimes \pi$6 grows (Oliva et al., 2024). The paper is explicit that it is best viewed as a latent-variable/interacting-particle extension of KLMC, with the number of particles playing the role of an inverse temperature (Oliva et al., 2024). After rescaling, the interacting diffusion becomes a standard underdamped Langevin SDE with potential $\mathcal N(0,I_d)\otimes \pi$7, so classical KLMC contraction and discretization theory can be imported into the latent-variable setting (Oliva et al., 2024). A crucial clarification is that KIPLD does not target the posterior of $\mathcal N(0,I_d)\otimes \pi$8; rather, it targets a temperature-controlled surrogate

$\mathcal N(0,I_d)\otimes \pi$9

whose mode is the MMLE (Oliva et al., 2024).

Another direction concerns unbiased estimation. One paper presents an unbiased method for Bayesian posterior means based on kinetic Langevin dynamics that combines advanced splitting methods with enhanced gradient approximations, avoids Metropolis correction by coupling Markov chains at different discretization levels in a multilevel Monte Carlo approach, and proves that the estimator is unbiased, attains finite variance, and satisfies a central limit theorem (Chada et al., 2023). Its expected complexity for estimating expectations of Lipschitz functions in $\pi(x)\propto e^{-f(x)}$0 dimensions is $\pi(x)\propto e^{-f(x)}$1 expected gradient evaluations, with similar bounds using both approximate and stochastic gradients, and the computational cost is shown to scale independently of the size of the dataset (Chada et al., 2023). In the supplied description of that work, the UBU splitting scheme is emphasized because its strong second order property and generally high accuracy make it suitable for unbiased estimation (Chada et al., 2023).

6. Empirical behavior, applications, and limitations

The empirical literature presents a consistent but qualified picture. In strongly log-concave theory, the main advertised advantage of KLMC over LMC is improved dependence on precision and dimension in regimes where the underdamped dynamics can exploit smoother trajectories and smaller discretization error (Dalalyan et al., 2018). In splitting-based unadjusted KLMC, randomized high-order Hamiltonian integrators substantially improve simulation efficiency relative to Verlet and an earlier $\pi(x)\propto e^{-f(x)}$2-order randomized method; on a logistic regression posterior, the reported bias at fixed gradient budget is much smaller for the new randomized Runge–Kutta–Nyström schemes (Bou-Rabee et al., 2023).

For regime-switching KLMC, the practical message is that switching can exploit beneficial regimes while preserving the target and keeping the per-iteration cost essentially the same as KLMC plus a cheap finite-state Markov chain update (Wang et al., 31 Aug 2025). The experiments most directly relevant to KLMC show that RS-KLMC with a generator matrix having large spectral gap accelerates convergence in MSE relative to standard KLMC in Bayesian linear regression, while FRS-KLMC can accelerate convergence if the friction regime values are sufficiently large and well chosen (Wang et al., 31 Aug 2025).

For KIPLMC, the experiments compare MPGD, KIPLMC1, and KIPLMC2. On a synthetic Bayesian logistic regression latent-variable model, all methods concentrate around the true $\pi(x)\propto e^{-f(x)}$3 as $\pi(x)\propto e^{-f(x)}$4 increases and the variance decreases approximately as $\pi(x)\propto e^{-f(x)}$5; KIPLMC2 has variance comparable to MPGD and far smaller than KIPLMC1 (Oliva et al., 2024). On the Wisconsin breast cancer data, the most relevant message is numerical stability: as the step size grows, MPGD becomes unstable and explodes around $\pi(x)\propto e^{-f(x)}$6, KIPLMC1 also eventually becomes unstable, and KIPLMC2 remains stable over a much wider step-size range (Oliva et al., 2024).

The limitations are equally clear and vary by setting. The classical Euclidean KLMC guarantees are for smooth strongly log-concave targets, and KLMC2 requires additional Hessian Lipschitzness (Dalalyan et al., 2018). The convex-but-not-strongly-convex extension relies on strong convexification rather than a direct convex-only contraction analysis, and the numerical constants in the bounds are explicitly described as too large for direct practical use (Dalalyan et al., 2019). The regime-switching theory is only for smooth, strongly convex targets and does not solve the design problem of choosing optimal regime values or generator matrix (Wang et al., 31 Aug 2025). The Lie-group theory is restricted to compact connected Lie groups, and the convergence rate may be exponentially small in geometric scale under such weak assumptions (Kong et al., 2024). KIPLMC has substantial limitations as well: the theory requires global strong convexity and global Lipschitz gradients, the computational cost scales linearly in the number of particles $\pi(x)\propto e^{-f(x)}$7, and no nonconvex theory is proved there (Oliva et al., 2024).

Two misconceptions are repeatedly corrected by the literature. The first is that KLMC is automatically superior to overdamped LMC; the strongly log-concave comparison does not support that conclusion uniformly (Dalalyan et al., 2018). The second is that the exponential-integrator version of KLMC degenerates in the overdamped regime; the later refined analysis shows that, with proper time acceleration, it converges to the expected overdamped LMC behavior instead of breaking down (Kim et al., 4 Oct 2025).

Taken together, these results define KLMC as more than a single algorithm. It is a family of underdamped Langevin methods centered on phase-space Gibbs sampling, exact treatment of linear velocity damping, and nonasymptotic Wasserstein analysis. The common structure is stable across Euclidean sampling, convexification-based theory, high-order splitting, Lie-group geometry, regime switching, latent-variable interacting-particle inference, and unbiased multilevel estimators with inexact gradients.