


























The randomized midpoint Langevin Monte Carlo (RLMC), introduced by Shen and Lee (2019), is a variant of classical Unadjusted Langevin Algorithm. It was shown in the literature that the RLMC is an efficient algorithm for approximating high-dimensional probability distribution $π$. In this paper, we establish the exponential ergodicity of RLMC with constant step-size. Moreover, we design a dereasing-step size RLMC and provide its convergence rate in terms of a functional class distance.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。