Shifted Composition III: Local Error Framework for KL Divergence
Not on the map. Why?
Abstract (arXiv)
Coupling arguments are a central tool for bounding the deviation between two stochastic processes, but traditionally have been limited to Wasserstein metrics. In this paper, we apply the shifted composition rule--an information-theoretic principle introduced in our earlier work--in order to adapt coupling arguments to the Kullback-Leibler (KL) divergence. Our framework combine the strengths of two previously disparate approaches: local error analysis and Girsanov's theorem. Akin to the former, it yields tight bounds by incorporating the so-called weak error, and is user-friendly in that it only requires easily verified local assumptions; and akin to the latter, it yields KL divergence guarantees and applies beyond Wasserstein contractivity. We apply this framework to the problem of sampling from a target distribution π. Here, the two stochastic processes are the Langevin diffusion and an algorithmic discretization thereof. Our framework provides a unified analysis when π is assumed to be strongly log-concave (SLC), weakly log-concave (WLC), or to satisfy a log-Sobolev inequality (LSI). Among other results, this yields KL guarantees for the randomized midpoint discretization of the Langevin diffusion. Notably, our result: (1) yields the optimal tilde O(√ d/ε) rate in the SLC and LSI settings; (2) is the first result to hold beyond the 2-Wasserstein metric in the SLC setting; and (3) is the first result to hold in any metric in the WLC and LSI settings.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 23 Dec 2024.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 4; 2026: 3.
7 papers.
- 2025Sublinear iterations can suffice even for DDPMscited by 7
- 2025Pathway to O(√d) Complexity bound under Wasserstein metric of flow-based modelscited by 4
- 2025When Langevin Monte Carlo Meets Randomization: New Sampling Algorithms with Non-asymptotic Error Bounds beyond Log-Concavity and Gradient Lipschitznesscited by 1
- 2025Poisson Midpoint Method for Log Concave Sampling: Beyond the Strong Error Lower Boundscited by 0
- 2026Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Datacited by 0
- 2026R'enyi Tracking Bounds for Langevin Dynamics with Moving Targetscited by 0
- 2026Nonlocal Hamiltonian Dynamics on Sparse L'evy Graphs: Spectral Analysis and Multimodal Samplingcited by 0
- 2026Nonlocal Hamiltonian Dynamics on Sparse L'evy Graphs: Spectral Analysis and Multimodal Sampling1 Oct 2026
- 2026R'enyi Tracking Bounds for Langevin Dynamics with Moving Targets25 Aug 2026
- 2026Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data11 May 2026
- 2025Pathway to O(√d) Complexity bound under Wasserstein metric of flow-based models7 Dec 2025
- 2025Sublinear iterations can suffice even for DDPMs6 Nov 2025
- 2025When Langevin Monte Carlo Meets Randomization: New Sampling Algorithms with Non-asymptotic Error Bounds beyond Log-Concavity and Gradient Lipschitzness30 Sep 2025
- 2025Poisson Midpoint Method for Log Concave Sampling: Beyond the Strong Error Lower Bounds9 Jun 2025