On the Convergence of Langevin Monte Carlo: The Interplay between Tail Growth and Smoothness
Murat A. Erdogdu, Rasa Hosseinzadeh

TL;DR
This paper analyzes the convergence rates of unadjusted Langevin Monte Carlo for sampling from distributions with various tail behaviors and smoothness, revealing that the rate depends mainly on smoothness and tail growth in high dimensions.
Contribution
It provides a unified convergence rate analysis for Langevin Monte Carlo applicable to non-convex, weakly smooth potentials with linear or quadratic tail growth, extending previous results.
Findings
Convergence rate depends on smoothness parameter β and tail growth α.
Rate recovers known results for Lipschitz gradients and quadratic tails.
Framework applies to a wide class of non-convex potentials with weak smoothness.
Abstract
We study sampling from a target distribution using the unadjusted Langevin Monte Carlo (LMC) algorithm. For any potential function whose tails behave like for , and has -H\"older continuous gradient, we prove that steps are sufficient to reach the -neighborhood of a -dimensional target distribution in KL-divergence. This convergence rate, in terms of dependency, is not directly influenced by the tail growth rate of the potential function as long as its growth is at least linear, and it only relies on the order of smoothness . One notable consequence of this result is that for potentials with Lipschitz gradient,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Statistical Mechanics and Entropy · Stochastic processes and statistical mechanics
