English

The Tamed Unadjusted Langevin Algorithm

Methodology 2018-11-27 v3

Abstract

In this article, we consider the problem of sampling from a probability measure π\pi having a density on Rd\mathbb{R}^d known up to a normalizing constant, xeU(x)/RdeU(y)dyx\mapsto \mathrm{e}^{-U(x)} / \int_{\mathbb{R}^d} \mathrm{e}^{-U(y)} \mathrm{d} y. The Euler discretization of the Langevin stochastic differential equation (SDE) is known to be unstable in a precise sense, when the potential UU is superlinear, i.e. lim infx+U(x)/x=+\liminf_{\Vert x \Vert\to+\infty} \Vert \nabla U(x) \Vert / \Vert x \Vert = +\infty. Based on previous works on the taming of superlinear drift coefficients for SDEs, we introduce the Tamed Unadjusted Langevin Algorithm (TULA) and obtain non-asymptotic bounds in VV-total variation norm and Wasserstein distance of order 22 between the iterates of TULA and π\pi, as well as weak error bounds. Numerical experiments are presented which support our findings.

Keywords

Cite

@article{arxiv.1710.05559,
  title  = {The Tamed Unadjusted Langevin Algorithm},
  author = {Nicolas Brosse and Alain Durmus and Éric Moulines and Sotirios Sabanis},
  journal= {arXiv preprint arXiv:1710.05559},
  year   = {2018}
}
R2 v1 2026-06-22T22:14:37.393Z