On the Minimax Optimality of Estimating the Wasserstein Metric
Not on the map. Why?
Abstract (arXiv)
We study the minimax optimal rate for estimating the Wasserstein-1 metric between two unknown probability measures based on n i.i.d. empirical samples from them. We show that estimating the Wasserstein metric itself between probability measures, is not significantly easier than estimating the probability measures under the Wasserstein metric. We prove that the minimax optimal rates for these two problems are multiplicatively equivalent, up to a log log (n)/log (n) factor.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Aug 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1.
2 papers.