2021
DOI: 10.48550/arxiv.2105.11721
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A Central Limit Theorem for Semidiscrete Wasserstein Distances

Abstract: We address the problem of proving a Central Limit Theorem for the empirical optimal transport cost, √ n{Tc(Pn, Q) − Wc(P, Q)}, in the semi discrete case, i.e when the distribution P is finitely supported. We show that the asymptotic distribution is the supremun of a centered Gaussian process which is Gaussian under some additional conditions on the probability Q and on the cost. Such results imply the central limit theorem for the p-Wassertein distance, for p ≥ 1. Finally, the semidiscrete framework provides a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 16 publications
1
1
0
Order By: Relevance
“…This complements distributional limits for the one-sample estimator Tc,n = T c (μ n , ν) by del Barrio et al (2021). We also derive metric entropy bounds for F c if X is given in terms of the image of sufficiently regular functions on sufficiently nice domains, where we exploit the Lipschitz continuity, semi-concavity, or Hölder continuity of the cost function to obtain novel theoretical guarantees for the convergence rate of Tc,n (Theorems 3.3,3.8 and 3.11).…”
Section: Introductionsupporting
confidence: 57%
“…This complements distributional limits for the one-sample estimator Tc,n = T c (μ n , ν) by del Barrio et al (2021). We also derive metric entropy bounds for F c if X is given in terms of the image of sufficiently regular functions on sufficiently nice domains, where we exploit the Lipschitz continuity, semi-concavity, or Hölder continuity of the cost function to obtain novel theoretical guarantees for the convergence rate of Tc,n (Theorems 3.3,3.8 and 3.11).…”
Section: Introductionsupporting
confidence: 57%
“…. From a numerical point of view, however, this would lead to the computation of a semi-discrete optimal transportation plan, which has complexity O(n d/2 ), hence is unfeasible even for moderate d. While the computational complexity of our procedure does not depend on the dimension, its statistical performance does (see Fournier and Guillin (2015)) and, in that sense, we do not escape the curse of dimensionality-up to the case where P is finitely supported, see del Barrio, González-Sanz and Loubes (2021). Despite the fact that the literature on the computation of such maps is growing quite fastly (see Lévy, Mohayaee and von Hausegger (2020); Gallouët and Mérigot (2018); Meyron (2019); de Goes et al ( 2012)), the exisiting methods are restricted to dimension two, sometimes three.…”
Section: Relation To the Recent Literature On Numerical Optimal Trans...mentioning
confidence: 99%