mlsanityData to 7 Oct 2026

Sampling and estimation on manifolds using the Langevin diffusion

arXiv 2312.14882 ↗First posted 22 Dec 2023math.ST cs.NA math.NAcited by 5

Not on the map. Why?

Abstract (arXiv)

Error bounds are derived for sampling and estimation using a discretization of an intrinsically defined Langevin diffusion with invariant measure dμφ propto e-φ dvolg on a compact Riemannian manifold. Two estimators of linear functionals of μφ based on the discretized Markov process are considered: a time-averaging estimator based on a single trajectory and an ensemble-averaging estimator based on multiple independent trajectories. Imposing no restrictions beyond a nominal level of smoothness on φ, first-order error bounds, in discretization step size, on the bias and variance/mean-square error of both estimators are derived. The order of error matches the optimal rate in Euclidean and flat spaces, and leads to a first-order bound on distance between the invariant measure μφ and a stationary measure of the discretized Markov process. This order is preserved even upon using retractions when exponential maps are unavailable in closed form, thus enhancing practicality of the proposed algorithms. Generality of the proof techniques, which exploit links between two partial differential equations and the semigroup of operators corresponding to the Langevin diffusion, renders them amenable for the study of a more general class of sampling algorithms related to the Langevin diffusion. Conditions for extending analysis to the case of non-compact manifolds are discussed. Numerical illustrations with distributions, log-concave and otherwise, on the manifolds of positive and negative curvature elucidate on the derived bounds and demonstrate practical utility of the sampling algorithm.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 10 of its 86 references that are in the map. First posted on arXiv 22 Dec 2023.

Builds on

10 of 86 references.

References · 10

  1. 2022Riemannian Score-Based Generative Modellingcited by 216
  2. 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 206
  3. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
  4. 2014Consistency and fluctuations for stochastic gradient Langevin dynamicscited by 65
  5. 2022Convergence of the Riemannian Langevin Algorithmcited by 23
  6. 2020Riemannian Langevin Algorithm for Solving Semidefinite Programscited by 22
  7. 2020Fast Convergence of Langevin Dynamics on Manifold: Geodesics meet Log-Sobolevcited by 16
  8. 2016Rapid Mixing of Geodesic Walks on Manifolds with Positive Curvaturecited by 7
  9. 2022Geometric Methods for Sampling, Optimisation, Inference and Adaptive Agentscited by 5
  10. 2020A diffusion approach to Stein's method on Riemannian manifoldscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 4.

5 papers.