Quantified Cram\'er-Wold Continuity Theorem for the Kantorovich Transport Distance
Sergey G. Bobkov, Friedrich G\"otze

TL;DR
This paper provides a quantitative version of the Cramér-Wold theorem, establishing an upper bound for the Kantorovich transport distance between high-dimensional probability measures based on their one-dimensional projections, thus advancing understanding of measure convergence.
Contribution
It introduces a quantified Cramér-Wold continuity theorem that bounds the Kantorovich transport distance using one-dimensional projections, offering a new tool for analyzing measure convergence.
Findings
Provides an explicit upper bound for the Kantorovich distance
Quantifies the Cramér-Wold theorem for weak convergence
Enhances methods for comparing high-dimensional probability measures
Abstract
An upper bound for the Kantorovich transport distance between probability measures on multidimensional Euclidean spaces is given in terms of transport distances between one dimensional projections. This quantifies the Cram\'er-Wold continuity theorem for the weak convergence of probability measures.
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
TopicsMatrix Theory and Algorithms · Mathematical functions and polynomials · Functional Equations Stability Results
