Langevin Monte Carlo without Smoothness

05/30/2019
by   Niladri S. Chatterji, et al.
0

Langevin Monte Carlo (LMC) is an iterative algorithm used to generate samples from a distribution that is known only up to a normalizing constant. The nonasymptotic dependence of its mixing time on the dimension and target accuracy is understood only in the setting of smooth (gradient-Lipschitz) log-densities, a serious limitation for applications in machine learning. In this paper, we remove this limitation, providing polynomial-time convergence guarantees for a variant of LMC in the setting of nonsmooth log-concave distributions. At a high level, our results follow by leveraging the implicit smoothing of the log-density that comes from a small Gaussian perturbation that we add to the iterates of the algorithm and controlling the bias and variance that are induced by this perturbation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2020

Weakly smooth Langevin Monte Carlo using p-generalized Gaussian smoothing

Langevin Monte Carlo (LMC) is an iterative process for sampling from a d...
research
08/23/2017

Rapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave Distributions

We obtain several quantitative bounds on the mixing properties of the Ha...
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
01/26/2021

The Langevin Monte Carlo algorithm in the non-smooth log-concave case

We prove non-asymptotic polynomial bounds on the convergence of the Lang...
research
10/03/2020

Random Coordinate Langevin Monte Carlo

Langevin Monte Carlo (LMC) is a popular Markov chain Monte Carlo samplin...
research
12/23/2021

Analysis of Langevin Monte Carlo from Poincaré to Log-Sobolev

Classically, the continuous-time Langevin diffusion converges exponentia...
research
04/04/2022

A PRticle filter algorithm for nonparametric estimation of multivariate mixing distributions

Predictive recursion (PR) is a fast, recursive algorithm that gives a sm...

Please sign up or login with your details

Forgot password? Click here to reset