Minimax Distribution Estimation in Wasserstein Distance

02/24/2018
by   Shashank Singh, et al.
0

The Wasserstein metric is an important measure of distance between probability distributions, with several applications in machine learning, statistics, probability theory, and data analysis. In this paper, we upper and lower bound minimax rates for the problem of estimating a probability distribution under Wasserstein loss, in terms of metric properties, such as covering and packing numbers, of the underlying sample space.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset