The Tamed Unadjusted Langevin Algorithm
Methodology
2018-11-27 v3
Abstract
In this article, we consider the problem of sampling from a probability measure having a density on known up to a normalizing constant, . The Euler discretization of the Langevin stochastic differential equation (SDE) is known to be unstable in a precise sense, when the potential is superlinear, i.e. . 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 -total variation norm and Wasserstein distance of order between the iterates of TULA and , 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}
}