Underdamped Langevin MCMC with third order convergence
Maximilian Scott, D\'aire O'Kane, Andra\v{z} Jelin\v{c}i\v{c}, James Foster

TL;DR
This paper introduces a novel third order convergent numerical method for underdamped Langevin diffusion, achieving faster sampling error reduction under certain smoothness conditions, with practical validation on Bayesian logistic regression tasks.
Contribution
It presents the first gradient-only ULD method with third order convergence, improving sampling efficiency under specific smoothness assumptions.
Findings
Achieves $ ext{W}_2$ error $oldsymbol{ ext{O}(rac{ ext{d}^{1/2}}{ ext{ε}^{1/3}})}$ steps with third derivative Lipschitz continuity.
Performs competitively on real-world datasets compared to existing Langevin MCMC and NUTS.
Provides non-asymptotic error bounds for the proposed algorithm.
Abstract
In this paper, we propose a new numerical method for the underdamped Langevin diffusion (ULD) and present a non-asymptotic analysis of its sampling error in the 2-Wasserstein distance when the -dimensional target distribution is strongly log-concave and has varying degrees of smoothness. Precisely, under the assumptions that the gradient and Hessian of are Lipschitz continuous, our algorithm achieves a 2-Wasserstein error of in and steps respectively. Therefore, our algorithm has a similar complexity as other popular Langevin MCMC algorithms under matching assumptions. However, if we additionally assume that the third derivative of is Lipschitz continuous, then our algorithm achieves a 2-Wasserstein error of in…
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.
