We develop a computationally tractable method for estimating the optimal map between two distributions over $\mathbb{R}^d$ with rigorous finite-sample guarantees. Leveraging an entropic version of Brenier's theorem, we show that our estimator -- the \emph{barycentric projection} of the optimal entropic plan -- is easy to compute using Sinkhorn's algorithm. As a result, unlike current approaches for map estimation, which are slow to evaluate when the dimension or number of samples is large, our approach is parallelizable and extremely efficient even for massive data sets. Under smoothness assumptions on the optimal map, we show that our estimator enjoys comparable statistical performance to other estimators in the literature, but with much lower computational cost. We showcase the efficacy of our proposed estimator through numerical examples, even ones not explicitly covered by our assumptions. By virtue of Lepski's method, we propose a modified version of our estimator that is adaptive to the smoothness of the underlying optimal transport map. Our proofs are based on a modified duality principle for entropic optimal transport and on a method for approximating optimal entropic plans due to Pal (2019).
An improved central limit theorem and fast convergence rates for entropic transportation costs
IMUVA, Universidad de Valladolid(巴利亚多利德大学IMUVA数学研究所);IMT, Université de Toulouse(图卢兹大学图卢兹数学研究所);Center for Data Science, New York University(纽约大学数据科学中心)
Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem
Harvard University(哈佛大学);Massachusetts Institute of Technology(麻省理工学院)
我们证明了几个基本的统计界熵OT的平方欧几里德成本之间的亚高斯概率测度在任意维。首先,通过一个新的样本复杂度的结果,我们建立了收敛速率的熵OT的经验措施。我们的分析在Genevay et al.(2019)的边界上呈指数级改进,并将他们的工作扩展到无界测量。其次,我们基于Del Barrio和Loubes(2019)开发的技术建立了熵OT的中心极限定理。以前,这样的结果只在有限度量空间中才知道。作为我们的结果的应用,我们开发和分析了一种新的技术,用于估计被高斯噪声破坏的随机变量的熵。
INRIA (PreMeDICaL & HeKA)(INRIA(PreMeDICaL与HeKA));CNRS and ENS, PSL Université(CNRS与ENS,PSL大学);Mathematics Institute, University of Warwick(数学研究所,沃里克大学)