International audienceThis paper deals with the estimation of a probability measure on the real line from data observed with an additive noise. We are interested in rates of convergence for the Wasserstein metric of order p ≥ 1. The distribution of the errors is assumed to be known and to belong to a class of supersmooth or ordinary smooth distributions. We obtain in the univariate situation an improved upper bound in the ordinary smooth case and less restrictive conditions for the existing bound in the supersmooth one. In the ordinary smooth case, a lower bound is also provided, and numerical experiments illustrating the rates of convergence are presented
Several issues in machine learning and inverse problems require to generate discrete data, as if sam...
This article is dedicated to the estimation of Wasserstein distances and Wasserstein costs between t...
28 pagesIn a spirit close to classical Stein's method, we introduce a new technique to derive first ...
International audienceThis paper deals with the estimation of a probability measure on the real line...
The subject of this paper is the estimation of a probability measure on Rd from data observed with a...
International audienceThis paper is focused on the statistical analysis of probability measures $\bn...
We study the reknown deconvolution problem of recovering a distribution function from independent re...
An upper bound is given for the mean square Wasserstein distance between the empirical measure of a ...
We derive quantitative bounds on the rate of convergence in $L^1$ Wasserstein distance of general M-...
28 pagesWe are interested in the approximation in Wasserstein distance with index $\rho\ge 1$ of a p...
The Wasserstein distance between two probability measures on a metric spaceis a measure of closeness...
Consider an empirical measure P induced by iid samples from a -dimensional -subgaussian distributio...
We provide some non-asymptotic bounds, with explicit constants, that measure the rate of convergence...
We consider the problem of recovering a distribution function on the real line from observations add...
We provide some non asymptotic bounds, with explicit constants, that measure the rate of convergence...
Several issues in machine learning and inverse problems require to generate discrete data, as if sam...
This article is dedicated to the estimation of Wasserstein distances and Wasserstein costs between t...
28 pagesIn a spirit close to classical Stein's method, we introduce a new technique to derive first ...
International audienceThis paper deals with the estimation of a probability measure on the real line...
The subject of this paper is the estimation of a probability measure on Rd from data observed with a...
International audienceThis paper is focused on the statistical analysis of probability measures $\bn...
We study the reknown deconvolution problem of recovering a distribution function from independent re...
An upper bound is given for the mean square Wasserstein distance between the empirical measure of a ...
We derive quantitative bounds on the rate of convergence in $L^1$ Wasserstein distance of general M-...
28 pagesWe are interested in the approximation in Wasserstein distance with index $\rho\ge 1$ of a p...
The Wasserstein distance between two probability measures on a metric spaceis a measure of closeness...
Consider an empirical measure P induced by iid samples from a -dimensional -subgaussian distributio...
We provide some non-asymptotic bounds, with explicit constants, that measure the rate of convergence...
We consider the problem of recovering a distribution function on the real line from observations add...
We provide some non asymptotic bounds, with explicit constants, that measure the rate of convergence...
Several issues in machine learning and inverse problems require to generate discrete data, as if sam...
This article is dedicated to the estimation of Wasserstein distances and Wasserstein costs between t...
28 pagesIn a spirit close to classical Stein's method, we introduce a new technique to derive first ...