Convergence Rates for Empirical Measures of Markov Chains in Dual and Wasserstein Distances
Adrian Riekert

TL;DR
This paper establishes new convergence rate bounds for empirical measures of Markov chains in dual and Wasserstein distances, matching i.i.d. rates up to logarithmic factors and including concentration inequalities.
Contribution
It introduces a novel upper bound for convergence rates of empirical measures of Markov chains using Fourier and truncation techniques, extending known i.i.d. results.
Findings
New upper bounds for expected Wasserstein distances
Convergence rates match i.i.d. rates up to logs
Concentration inequalities around the mean
Abstract
We consider a Markov chain on with invariant measure . We are interested in the rate of convergence of the empirical measures towards the invariant measure with respect to various dual distances, including in particular the -Wasserstein distance. The main result of this article is a new upper bound for the expected distance, which is proved by combining a Fourier expansion with a truncation argument. Our bound matches the known rates for i.i.d. random variables up to logarithmic factors. In addition, we show how concentration inequalities around the mean can be obtained.
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.
