English

Shifted Composition III: Local Error Framework for KL Divergence

Statistics Theory 2024-12-25 v1 Data Structures and Algorithms Machine Learning Numerical Analysis Numerical Analysis Machine Learning Statistics Theory

Abstract

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 π\pi. Here, the two stochastic processes are the Langevin diffusion and an algorithmic discretization thereof. Our framework provides a unified analysis when π\pi 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 O~(d/ϵ)\tilde O(\sqrt d/\epsilon) 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 \emph{any} metric in the WLC and LSI settings.

Keywords

Cite

@article{arxiv.2412.17997,
  title  = {Shifted Composition III: Local Error Framework for KL Divergence},
  author = {Jason M. Altschuler and Sinho Chewi},
  journal= {arXiv preprint arXiv:2412.17997},
  year   = {2024}
}
R2 v1 2026-06-28T20:47:27.765Z