High-dimensional normal approximations for sums of Langevin Markov chains
Tian Shen, Zhonggen Su, Xiaolin Wang

TL;DR
This paper establishes high-dimensional normal approximation results for sums of Langevin Markov chains, providing the first explicit convergence rates in high dimensions using a novel Wasserstein distance bound.
Contribution
It introduces a new method to bound the 1-Wasserstein distance for high-dimensional sums of Langevin chain states, with explicit convergence rates.
Findings
First dimension-explicit convergence rates in high-dimensional Langevin sums
Novel upper bound for 1-Wasserstein distance using exchange pair approach
Applicable to high-dimensional Langevin Markov chain analysis
Abstract
Consider the well-known Langevin diffusion on and its Euler-Maruyama discretization given by where is the step size. Under mild conditions, the Langevin diffusion admits as its unique stationary distribution. In this paper, we mainly study the normal approximation of the normalized partial sum To the best of our knowledge, this work provides the first dimension-explicit convergence rates in high-dimensional settings. Our main tool is a novel upper bound for the 1-Wasserstein distance via the exchange pair approach, where is any random vector of…
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
TopicsRandom Matrices and Applications · Markov Chains and Monte Carlo Methods · Stochastic processes and statistical mechanics
