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

07/22/2020
by   Murat A. Erdogdu, et al.
0

We study sampling from a target distribution ν_* ∝ e^-f using the unadjusted Langevin Monte Carlo (LMC) algorithm when the target ν_* satisfies the Poincaré inequality, and the potential f is first-order smooth and dissipative. Under an opaque uniform warmness condition on the LMC iterates, we establish that 𝒪(ϵ^-1) steps are sufficient for LMC to reach ϵ neighborhood of the target in Chi-square divergence. We hope that this note serves as a step towards establishing a complete convergence analysis of LMC under Chi-square divergence.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
05/23/2019

A Condition Number for Hamiltonian Monte Carlo

Hamiltonian Monte Carlo is a popular sampling technique for smooth targe...
research
05/27/2020

On the Convergence of Langevin Monte Carlo: The Interplay between Tail Growth and Smoothness

We study sampling from a target distribution ν_* = e^-f using the unadju...
research
09/08/2021

Sqrt(d) Dimension Dependence of Langevin Monte Carlo

This article considers the popular MCMC method of unadjusted Langevin Mo...
research
11/04/2019

Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry

We study the Proximal Langevin Algorithm (PLA) for sampling from a proba...
research
06/19/2018

Letter to the Editor

Galarza, Lachos and Bandyopadhyay (2017) have recently proposed a method...
research
10/04/2021

Generalized Kernel Thinning

The kernel thinning (KT) algorithm of Dwivedi and Mackey (2021) compress...

Please sign up or login with your details

Forgot password? Click here to reset