Minimax rates of convergence for Wasserstein deconvolution with supersmooth errors in any dimension
Abstract
The subject of this paper is the estimation of a probability measure on Rd from data observed with an additive noise, under the Wasserstein metric of order p (with p≥ 1). We assume that the distribution of the errors is known and belongs to a class of supersmooth distributions, and we give optimal rates of convergence for the Wasserstein metric of order p. In particular, we show how to use the existing lower bounds for the estimation of the cumulative distribution function in dimension one to find lower bounds for the Wasserstein deconvolution in any dimension.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.