ON THE DIFFERENCE BETWEEN ENTROPIC COST AND THE OPTIMAL TRANSPORT COST

• 成果类型: Article
• 署名作者: Pal, Soumik
• 署名单位: University of Washington; University of Washington Seattle
• 刊物名称: ANNALS OF APPLIED PROBABILITY
• ISSN/ISSBN: 1050-5164
• DOI: 10.1214/23-AAP1983
• 发表日期: 2024
• 页码: 1003-1028
• 关键词: gradient flows; large-deviations; geometry; PRINCIPLE

摘要

Consider the Monge-Kantorovich problem of transporting densities rho(0) to rho(1) on R-d with a strictly convex cost function. A popular regularization of the problem is the one-parameter family called the entropic cost problem. The entropic cost K-h, h> 0, is significantly faster to compute and hK(h) is known to converge to the optimal transport cost as h goes to zero. We are interested in the rate of convergence. We show that the difference between K-h and 1/ h times the optimal cost of transport has a pointwise limit when transporting a compactly supported density to another that satisfies a few other technical restrictions. This limit is the relative entropy of.1 with respect to a weighted Riemannian volume measure on R-d that measures the local sensitivity of the transport map. For the quadratic Wasserstein transport, this relative entropy is exactly one half of the difference of entropies of rho(1) and rho(0). More surprisingly, we demonstrate that this difference of two entropies (plus the cost) is also the limit for the Dirichlet transport introduced by Pal andWong (Probab. Theory Related Fields 178 (2020) 613-654) in the context of stochastic portfolio theory. The latter can be thought of as a multiplicative analog of the Wasserstein transport and corresponds to a nonlocal operator. The proofs are based on Gaussian approximations to Schrodinger bridges as h approaches zero.