Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm

12/23/2020
by   Sinho Chewi, et al.
0

Conventional wisdom in the sampling literature, backed by a popular diffusion scaling limit, suggests that the mixing time of the Metropolis-Adjusted Langevin Algorithm (MALA) scales as O(d^1/3), where d is the dimension. However, the diffusion scaling limit requires stringent assumptions on the target distribution and is asymptotic in nature. In contrast, the best known non-asymptotic mixing time bound for MALA on the class of log-smooth and strongly log-concave distributions is O(d). In this work, we establish that the mixing time of MALA on this class of target distributions is Θ(d^1/2) under a warm start. Our upper bound proof introduces a new technique based on a projection characterization of the Metropolis adjustment which reduces the study of MALA to the well-studied discretization analysis of the Langevin SDE and bypasses direct computation of the acceptance probability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2021

Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling

We study the mixing time of the Metropolis-adjusted Langevin algorithm (...
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 ...
research
02/23/2023

Efficiently handling constraints with Metropolis-adjusted Langevin algorithm

In this study, we investigate the performance of the Metropolis-adjusted...
research
12/01/2021

On Mixing Times of Metropolized Algorithm With Optimization Step (MAO) : A New Framework

In this paper, we consider sampling from a class of distributions with t...
research
09/08/2021

Sqrt(d) Dimension Dependence of Langevin Monte Carlo

This article considers the popular MCMC method of unadjusted Langevin Mo...
research
02/26/2022

Metropolis Adjusted Langevin Trajectories: a robust alternative to Hamiltonian Monte Carlo

Hamiltonian Monte Carlo (HMC) is a widely used sampler, known for its ef...
research
06/24/2020

Penalized Langevin dynamics with vanishing penalty for smooth and log-concave targets

We study the problem of sampling from a probability distribution on ℝ^p ...

Please sign up or login with your details

Forgot password? Click here to reset