首页 | 本学科首页   官方微博 | 高级检索  
     


The tamed unadjusted Langevin algorithm
Authors:Nicolas Brosse  Alain Durmus  Éric Moulines  Sotirios Sabanis
Abstract:In this article, we consider the problem of sampling from a probability measure π having a density on Rd proportional to x?e?U(x). The Euler discretization of the Langevin stochastic differential equation (SDE) is known to be unstable, when the potential U is superlinear. 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 V-total variation norm and Wasserstein distance of order 2 between the iterates of TULA and π, as well as weak error bounds. Numerical experiments are presented which support our findings.
Keywords:Corresponding author.  65C05  60F05  62L10  Tamed unadjusted Langevin algorithm  Markov chain Monte Carlo  Total variation distance  Wasserstein distance
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号