On the Minimax Optimality of Estimating the Wasserstein Metric

Abstract

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.

13 pages

Cited by in corpus (4)

• Minimax Confidence Intervals for the Sliced Wasserstein Distance
• Sharp Convergence Rates for Empirical Optimal Transport with Smooth Costs
• Estimating Certain Integral Probability Metric (IPM) is as Hard as Estimating under the IPM
• Statistical analysis of Wasserstein GANs with applications to time series forecasting