Hessian Riemannian Langevin Monte Carlo (HRLMC)

• HRLMC is a geometric sampling algorithm that extends Langevin Monte Carlo using Hessian manifolds and mirror descent for high-dimensional, non-Euclidean problems.
• The algorithm provides non-asymptotic convergence bounds in Wasserstein and KL divergences by accommodating local metric properties and constrained geometries.
• By unifying Riemannian SDEs, interior-point methods, and optimal transport, HRLMC offers robust performance and explicit metric-dependent contraction rates.

The Hessian Riemannian Langevin Monte Carlo (HRLMC) algorithm is a geometric extension of Langevin Monte Carlo for efficient sampling from high-dimensional probability densities, particularly those lacking global regularity in the standard Euclidean setting. HRLMC leverages a Hessian manifold structure and mirror-descent techniques to model non-flat or constrained geometries, providing non-asymptotic convergence bounds in Wasserstein and Kullback–Leibler distances. This framework unifies Riemannian stochastic differential equations (SDEs), interior-point methods, and optimal transport theory, resolving difficulties in the analysis and computation of Riemannian discretizations by introducing relative smoothness, self-concordance, and explicit metric-dependent contraction rates (Zhang et al., 2020, Gatmiry et al., 2022).

1. Hessian Manifold Structure and Riemannian Metrics

Let $X \subset \mathbb{R}^p$ be open and contractible, and let $\varphi : X \to \mathbb{R}$ be a $C^2$ Legendre-type convex function (often called the "mirror potential" or barrier function). The Hessian manifold is endowed with the metric

$g_x(u, v) = u^\top [D^2 \varphi(x)]\, v$

where $D^2 \varphi(x)$ is positive definite for all $x \in X$. This construction allows dual coordinates $y = \nabla \varphi(x)$, in which the metric becomes Euclidean and Riemannian quantities push forward via the mirror map. Important classes of $\varphi$ include the Euclidean case $\varphi(x) = \frac{1}{2} \|x\|^2$ and the log-barrier $\varphi(x) = -\sum_i \log(a_i^\top x - b_i)$ for polytope constraints, which yield $\varphi : X \to \mathbb{R}$0 (Zhang et al., 2020, Gatmiry et al., 2022).

2. Riemannian Langevin Diffusion: SDE Formulation

Let $\varphi : X \to \mathbb{R}$1 be a target density $\varphi : X \to \mathbb{R}$2, $\varphi : X \to \mathbb{R}$3. The Riemannian Langevin diffusion (RLD) on $\varphi : X \to \mathbb{R}$4 is the Itô SDE:

$\varphi : X \to \mathbb{R}$5

where

$\varphi : X \to \mathbb{R}$6

The invariant measure of this diffusion is $\varphi : X \to \mathbb{R}$7 by Fokker–Planck analysis. In coordinates $\varphi : X \to \mathbb{R}$8 the SDE simplifies, and the diffusion is natural Brownian motion on the manifold, with drift $\varphi : X \to \mathbb{R}$9 and diffusion $C^2$0 (Zhang et al., 2020, Gatmiry et al., 2022).

3. Discrete HRLMC Scheme and Mirror Descent Analogy

The discretization leading to HRLMC is performed in the dual space and mapped back via the Legendre conjugate. With step-size $C^2$1 and i.i.d. $C^2$2: $C^2$3 HRLMC is the sampling analogue of mirror descent: setting $C^2$4 yields the mirror descent step for $C^2$5 with mirror map $C^2$6. The stochastic perturbation ensures the correct stationary distribution $C^2$7. In the Euclidean case, HRLMC recovers Unadjusted Langevin Algorithm (ULA) (Zhang et al., 2020). For constrained domains (e.g., polytopes), ULA in local charts uses the metric and steps: $C^2$8 (Gatmiry et al., 2022).

4. Assumptions, Metric Properties, and Self-Concordance

Non-asymptotic convergence proofs require the following conditions:

• A1 (Self-concordance-like control): $C^2$9 such that $g_x(u, v) = u^\top [D^2 \varphi(x)]\, v$0.
• A2 (Moment bound): $g_x(u, v) = u^\top [D^2 \varphi(x)]\, v$1.
• A3 (Relative strong convexity of $g_x(u, v) = u^\top [D^2 \varphi(x)]\, v$2): $g_x(u, v) = u^\top [D^2 \varphi(x)]\, v$3 with $g_x(u, v) = u^\top [D^2 \varphi(x)]\, v$4.
• A4 (Relative gradient Lipschitzness): $g_x(u, v) = u^\top [D^2 \varphi(x)]\, v$5 such that $g_x(u, v) = u^\top [D^2 \varphi(x)]\, v$6.
• A5 (Commutator bound): $g_x(u, v) = u^\top [D^2 \varphi(x)]\, v$7.

Self-concordance is extended to second-order conditions: bounds on derivatives of the metric and its inverse, controlling the Jacobian growth and ensuring discretization errors remain manageable (Gatmiry et al., 2022).

5. Non-Asymptotic Convergence Bounds and Wasserstein Geometry

HRLMC delivers explicit, non-asymptotic contraction rates in the Wasserstein ground metric: $g_x(u, v) = u^\top [D^2 \varphi(x)]\, v$8 With step-size $g_x(u, v) = u^\top [D^2 \varphi(x)]\, v$9 and contraction factor $D^2 \varphi(x)$0, for all $D^2 \varphi(x)$1,

$D^2 \varphi(x)$2

where $D^2 \varphi(x)$3 and explicit constants $D^2 \varphi(x)$4 are supplied as functions of dimension, moment bounds, and regularity parameters. For constant step-size, iterates contract to an explicit Wasserstein ball around $D^2 \varphi(x)$5 and remain inside, with radius proportional to $D^2 \varphi(x)$6 and local geometry (Zhang et al., 2020).

For second-order self-concordant metrics, the convergence in Kullback–Leibler divergence is: $D^2 \varphi(x)$7 where $D^2 \varphi(x)$8 denotes KL divergence relative to $D^2 \varphi(x)$9 and $x \in X$0, $x \in X$1 are Lipschitz constants of $x \in X$2 and its Hessian (Gatmiry et al., 2022).

6. Specializations and Applications

Euclidean LMC: Setting $x \in X$3 yields $x \in X$4, $x \in X$5, recovers classical LMC with optimal Wasserstein bounds.

Constrained Sampling: For polytopes $x \in X$6, using the log-barrier $x \in X$7 yields $x \in X$8 with self-concordant constants $x \in X$9. HRLMC enables polynomial-time sampling of isoperimetric densities given gradient oracles and avoids global smoothness requirements.

Other Metrics: Adapting $y = \nabla \varphi(x)$0 to the geometry of $y = \nabla \varphi(x)$1 allows sampling from densities in non-Euclidean geometries, e.g., Dirichlet or gamma posteriors on the simplex (Zhang et al., 2020).

7. Key Analytical Tools and Proofs

HRLMC analysis relies on:

• Extended Baillon–Haddad Inequality: For relative smoothness, establishes cocoercivity bounds between gradients of $y = \nabla \varphi(x)$2 and the mirror map.
• Itô’s Isometry and Minkowski Integral Inequality: Manage stochastic error terms and bias in diffusion discretization.
• Chung’s Lemma: Demonstrates contraction to a Wasserstein ball under vanishing step-sizes.
• Bismut–Elworthy–Li Formula: Controls higher-order terms in stochastic flows.
• Self-Concordance Theory: Manages metric derivatives and stability (Nesterov–Nemirovskii).

These tools together establish dimension-dependent rates, validate non-asymptotic guarantees, and ensure robustness to variance in local geometry (Zhang et al., 2020, Gatmiry et al., 2022).

---

HRLMC thus constitutes an advanced geometric Monte Carlo method tailored for high-dimensional, non-Euclidean, and constrained sampling problems, bridging stochastic analysis, convex optimization, and differential geometry. The rigorous contraction rates and metric-dependent bounds enable its application to non-smooth log-concave target distributions and provide theoretical foundations for sampling in complex domains.