Dimension-Independent Convergence of Underdamped Langevin Monte Carlo in KL Divergence
Shiyuan Zhang, Qiwei Di, Xuheng Li, Quanquan Gu

TL;DR
This paper proves the first dimension-free KL divergence convergence bounds for discretized underdamped Langevin dynamics, improving understanding of its efficiency in high-dimensional sampling tasks.
Contribution
It introduces a dimension-free analysis framework for ULD in KL divergence, depending on trace of the Hessian rather than ambient dimension.
Findings
Provides dimension-independent KL divergence bounds for ULD
Yields improved iteration complexity over overdamped Langevin methods in certain regimes
Refines the KL local error framework to a dimension-free setting
Abstract
Underdamped Langevin dynamics (ULD) is a widely-used sampler for Gibbs distributions , and is often empirically effective in high dimensions. However, existing non-asymptotic convergence guarantees for discretized ULD typically scale polynomially with the ambient dimension , leading to vacuous bounds when is large. The main known dimension-free result concerns the randomized midpoint discretization in Wasserstein-2 distance (Liu et al.,2023), while dimension-independent guarantees for ULD discretizations in KL divergence have remained open. We close this gap by proving the first dimension-free KL divergence bounds for discretized ULD. Our analysis refines the KL local error framework (Altschuler et al., 2025) to a dimension-free setting and yields bounds that depend on , where upper bounds the Hessian of , rather than on…
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 · Stochastic Gradient Optimization Techniques · Generative Adversarial Networks and Image Synthesis
