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

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment