2000 character limit reached
Sharp bounds for max-sliced Wasserstein distances (2403.00666v6)
Published 1 Mar 2024 in math.PR and stat.ML
Abstract: We obtain essentially matching upper and lower bounds for the expected max-sliced 1-Wasserstein distance between a probability measure on a separable Hilbert space and its empirical distribution from $n$ samples. By proving a Banach space version of this result, we also obtain an upper bound, that is sharp up to a log factor, for the expected max-sliced 2-Wasserstein distance between a symmetric probability measure $\mu$ on a Euclidean space and its symmetrized empirical distribution in terms of the operator norm of the covariance matrix of $\mu$ and the diameter of the support of $\mu$.
- R. Adamczak, A. E. Litvak, A. Pajor and N. Tomczak-Jaegermann, “Sharp bounds on the rate of convergence of the empirical covariance matrix.” Comptes Rendus. Mathématique 349.3-4 (2011): 195-200.
- M. Rudelson, “Random vectors in the isotropic position.” Journal of Functional Analysis 164.1 (1999): 60-72.
- K. Tikhomirov, “Sample covariance matrices of heavy-tailed distributions.” International Mathematics Research Notices 2018.20 (2018): 6254-6289.
- J. A. Tropp, “An introduction to matrix concentration inequalities.” Foundations and Trends in Machine Learning 8.1-2 (2015): 1-230.