English

Sharp bounds for max-sliced Wasserstein distances

Probability 2024-11-27 v6 Machine Learning

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 nn 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.

Keywords

Cite

@article{arxiv.2403.00666,
  title  = {Sharp bounds for max-sliced Wasserstein distances},
  author = {March T. Boedihardjo},
  journal= {arXiv preprint arXiv:2403.00666},
  year   = {2024}
}

Comments

To appear in Journal of Foundations of Computational Mathematics

R2 v1 2026-06-28T15:06:08.686Z