Max-sliced Wasserstein concentration and uniform ratio bounds of empirical measures on RKHS
Not on the map. Why?
Abstract (arXiv)
Optimal transport and the Wasserstein distance Wp have recently seen a number of applications in the fields of statistics, machine learning, data science, and the physical sciences. These applications are however severely restricted by the curse of dimensionality, meaning that the number of data points needed to estimate these problems accurately increases exponentially in the dimension. To alleviate this problem, a number of variants of Wp have been introduced. We focus here on one of these variants, namely the max-sliced Wasserstein metric overlineWp. This metric reduces the high-dimensional minimization problem given by Wp to a maximum of one-dimensional measurements in an effort to overcome the curse of dimensionality. In this note we derive concentration results and upper bounds on the expectation of overlineWp between the true and empirical measure on unbounded reproducing kernel Hilbert spaces. We show that, under quite generic assumptions, probability measures concentrate uniformly fast in one-dimensional subspaces, at (nearly) parametric rates. Our results rely on an improvement of currently known bounds for overlineWp in the finite-dimensional case.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 15 of its 67 references that are in the map. First posted on arXiv 21 May 2024.
Builds on
15 of 67 references.
References · 15
- 2019Generalized Sliced Wasserstein Distancescited by 205
- 2018Gromov-Wasserstein Alignment of Word Embedding Spacescited by 119
- 2019Max-Sliced Wasserstein Distance and its use for GANscited by 118
- 2018Generative Modeling using the Sliced Wasserstein Distancecited by 108
- 2019Subspace Robust Wasserstein Distancescited by 89
- 2020Faster Wasserstein Distance Estimation with the Sinkhorn Divergencecited by 73
- 2018Convergence and Concentration of Empirical Measures under Wasserstein Distance in Unbounded Functional Spacescited by 41
- 2022Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein Distancescited by 41
- 2020On Projection Robust Optimal Transport: Sample Complexity and Model Misspecificationcited by 34
- 2015The Radon cumulative distribution transform and its application to image classificationcited by 28
- 2015Fast Optimal Transport Averaging of Neuroimaging Datacited by 26
- 2019Minimax Confidence Intervals for the Sliced Wasserstein Distancecited by 24
3 more
Built on by
Citing papers per year: 2026: 1.
1 paper.