An Improved Central Limit Theorem and Fast Convergence Rates for Entropic Transportation Costs

被引:17
作者
del Barrio, Eustasio [1 ]
Sanz, Alberto Gonzalez [2 ]
Loubes, Jean-Michel [2 ]
Niles-Weed, Jonathan [3 ,4 ]
机构
[1] Univ Valladolid, IMUVA, Valladolid, Spain
[2] Univ Toulouse, IMT, Toulouse, France
[3] NYU, Courant Inst Math Sci, New York, NY 10012 USA
[4] NYU, Ctr Data Sci, New York, NY 10012 USA
来源
SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE | 2023年 / 5卷 / 03期
基金
美国国家科学基金会;
关键词
optimal transport; entropic regularization; central limit theorem; Sinkhorn divergence; REGULARIZED OPTIMAL TRANSPORT; MATCHING ESTIMATORS; ASYMPTOTICS; INFERENCE; SPACES; RANKS; TESTS;
D O I
10.1137/22M149260X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We prove a central limit theorem for the entropic transportation cost between subgaussian probability measures, centered at the population cost. This is the first result which allows for asymptotically valid inference for entropic optimal transport between measures which are not necessarily discrete. In the compactly supported case, we complement these results with new, faster, convergence rates for the expected entropic transportation cost between empirical measures. Our proof is based on strengthening convergence results for dual solutions to the entropic optimal transport problem.
引用
收藏
页码:639 / 669
页数:31
相关论文
共 79 条
[1]   Large sample properties of matching estimators for average treatment effects [J].
Abadie, A ;
Imbens, GW .
ECONOMETRICA, 2006, 74 (01) :235-267
[2]   ASYMPTOTICS FOR SEMIDISCRETE ENTROPIC OPTIMAL TRANSPORT* [J].
Altschuler, Jason M. ;
Niles-Weed, Jonathan ;
Stromme, Austin J. .
SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2022, 54 (02) :1718-1741
[3]  
Alvarez-Melis D, 2018, 2018 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2018), P1881
[4]  
Bachoc F., 2023, INT C ARTIFICIAL INT, V206, P4986
[5]   The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampere equations [J].
Berman, Robert J. .
NUMERISCHE MATHEMATIK, 2020, 145 (04) :771-836
[6]   Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications [J].
Bigot, Jeremie ;
Cazelles, Elsa ;
Papadakis, Nicolas .
ELECTRONIC JOURNAL OF STATISTICS, 2019, 13 (02) :5120-5150
[7]   FlipTest: Fairness Testing via Optimal Transport [J].
Black, Emily ;
Yeom, Samuel ;
Fredrikson, Matt .
FAT* '20: PROCEEDINGS OF THE 2020 CONFERENCE ON FAIRNESS, ACCOUNTABILITY, AND TRANSPARENCY, 2020, :111-121
[8]   ROBUST WASSERSTEIN PROFILE INFERENCE AND APPLICATIONS TO MACHINE LEARNING [J].
Blanchet, Jose ;
Kang, Yang ;
Murthy, Karthyek .
JOURNAL OF APPLIED PROBABILITY, 2019, 56 (03) :830-857
[9]   MONGE-KANTOROVICH DEPTH, QUANTILES, RANKS AND SIGNS [J].
Chernozhukov, Victor ;
Galichon, Alfred ;
Hallin, Marc ;
Henry, Marc .
ANNALS OF STATISTICS, 2017, 45 (01) :223-256
[10]  
Chiappa S, 2021, Arxiv, DOI arXiv:2101.02084