On the Minimax Optimality of Estimating the Wasserstein Metric

08/27/2019
by   Tengyuan Liang, et al.
0

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 loglog (n)/log (n) factor.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/02/2019

Estimating Certain Integral Probability Metric (IPM) is as Hard as Estimating under the IPM

We study the minimax optimal rates for estimating a range of Integral Pr...
research
02/24/2018

Minimax Distribution Estimation in Wasserstein Distance

The Wasserstein metric is an important measure of distance between proba...
research
02/05/2019

Estimation of smooth densities in Wasserstein distance

The Wasserstein distances are a set of metrics on probability distributi...
research
07/19/2023

Memory Efficient And Minimax Distribution Estimation Under Wasserstein Distance Using Bayesian Histograms

We study Bayesian histograms for distribution estimation on [0,1]^d unde...
research
09/07/2022

On the Wasserstein median of probability measures

Measures of central tendency such as mean and median are a primary way t...
research
10/10/2019

Computationally Efficient Tree Variants of Gromov-Wasserstein

We propose two novel variants of Gromov-Wasserstein (GW) between probabi...
research
01/08/2017

A Framework for Wasserstein-1-Type Metrics

We propose a unifying framework for generalising the Wasserstein-1 metri...

Please sign up or login with your details

Forgot password? Click here to reset