Hostname: page-component-5db58dd55d-jhf8m Total loading time: 0 Render date: 2026-06-01T00:24:40.901Z Has data issue: false hasContentIssue false

Non-asymptotic analysis of Langevin-type Monte Carlo algorithms

Published online by Cambridge University Press:  10 December 2025

Shogo Nakakita*
Affiliation:
University of Tokyo
*
Postal address: Komaba Institute for Science, University of Tokyo, 3-8-1 Komaba, Meguro, Tokyo 153-8902, Japan. Email: nakakita@g.ecc.u-tokyo.ac.jp
Rights & Permissions [Opens in a new window]

Abstract

We study Langevin-type algorithms for sampling from Gibbs distributions such that the potentials are dissipative and their weak gradients have finite moduli of continuity not necessarily convergent to zero. Our main result is a non-asymptotic upper bound on the 2-Wasserstein distance between a Gibbs distribution and the law of general Langevin-type algorithms based on a Liptser–Shiryaev-type condition for change of measures and Poincaré inequalities. We apply this bound to show that the Langevin Monte Carlo algorithm can approximate Gibbs distributions with arbitrary accuracy if the potentials are dissipative and their gradients are uniformly continuous. We also propose Langevin-type algorithms with spherical smoothing for distributions whose potentials are not convex or continuously differentiable and show their polynomial complexities.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

Figure 1. The chains of implications.