DeepAI AI Chat
Log In Sign Up

High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion

by   Pierre Monmarché, et al.

The efficiency of a markov sampler based on the underdamped Langevin diffusion is studied for high dimensionial targets with convex and smooth potentials. We consider a classical second-order integrator which requires only one gradient computation per iteration. Contrary to previous works on similar samplers, a dimension-free contraction of Wasserstein distances and convergence rate for the total variance distance are proved for the discrete time chain itself. Non-asymptotic Wasserstein and total variation efficiency bounds and concentration inequalities are obtained for both the Metropolis adjusted and unadjusted chains. In terms of the dimension d and the desired accuracy ε, the Wasserstein efficiency bounds are of order √(d) / ε in the general case, √(d/ε) if the Hessian of the potential is Lipschitz, and d^1/4/√(ε) in the case of a separable target, in accordance with known results for other kinetic Langevin or HMC schemes.


page 1

page 2

page 3

page 4


Central limit theorems for Markov chains based on their convergence rates in Wasserstein distance

Many tools are available to bound the convergence rate of Markov chains ...

Higher Order Langevin Monte Carlo Algorithm

A new (unadjusted) Langevin Monte Carlo (LMC) algorithm with improved ra...

Wasserstein-based methods for convergence complexity analysis of MCMC with application to Albert and Chib's algorithm

Over the last 25 years, techniques based on drift and minorization (d&m)...

Lower Bounds on the Rate of Convergence for Accept-Reject-Based Markov Chains

To avoid poor empirical performance in Metropolis-Hastings and other acc...

Unajusted Langevin algorithm with multiplicative noise: Total variation and Wasserstein bounds

In this paper, we focus on non-asymptotic bounds related to the Euler sc...

Non-asymptotic convergence bounds for modified tamed unadjusted Langevin algorithm in non-convex setting

We consider the problem of sampling from a high-dimensional target distr...

Sharp Convergence Rates for Langevin Dynamics in the Nonconvex Setting

We study the problem of sampling from a distribution where the negative ...