Sqrt(d) Dimension Dependence of Langevin Monte Carlo

09/08/2021
by   Ruilin Li, et al.
0

This article considers the popular MCMC method of unadjusted Langevin Monte Carlo (LMC) and provides a non-asymptotic analysis of its sampling error in 2-Wasserstein distance. The proof is based on a mean-square analysis framework refined from Li et al. (2019), which works for a large class of sampling algorithms based on discretizations of contractive SDEs. We establish an Õ(√(d)/ϵ) mixing time bound for LMC, without warm start, under the common log-smooth and log-strongly-convex conditions, plus a growth condition on the 3rd-order derivative of the potential of target measures. This bound improves the best previously known Õ(d/ϵ) result and is optimal (in terms of order) in both dimension d and accuracy tolerance ϵ for target measures satisfying the aforementioned assumptions. Our theoretical analysis is further validated by numerical experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/19/2019

Stochastic Runge-Kutta Accelerates Langevin Monte Carlo and Beyond

Sampling with Markov chain Monte Carlo methods typically amounts to disc...
research
12/23/2020

Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm

Conventional wisdom in the sampling literature, backed by a popular diff...
research
09/29/2017

User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient

In this paper, we revisit the recently established theoretical guarantee...
research
07/05/2022

Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Time

Hamiltonian Monte Carlo (HMC) is a popular method in sampling. While the...
research
07/22/2020

A Brief Note on the Convergence of Langevin Monte Carlo in Chi-Square Divergence

We study sampling from a target distribution ν_* ∝ e^-f using the unadju...
research
07/12/2017

Underdamped Langevin MCMC: A non-asymptotic analysis

We study the underdamped Langevin diffusion when the log of the target d...
research
06/13/2022

On the Computational Complexity of Metropolis-Adjusted Langevin Algorithms for Bayesian Posterior Sampling

In this paper, we study the computational complexity of sampling from a ...

Please sign up or login with your details

Forgot password? Click here to reset