On the difference between entropic cost and the optimal transport cost
Soumik Pal

TL;DR
This paper investigates the convergence rate of entropic cost to optimal transport cost, revealing a limit related to relative entropy and connecting it to gradient flows and non-local operators.
Contribution
It establishes the pointwise limit of the scaled difference between entropic and optimal transport costs, linking it to relative entropy and extending previous results to Dirichlet transport.
Findings
The difference between scaled entropic and optimal costs converges to a relative entropy measure.
For quadratic Wasserstein transport, this limit equals half the entropy difference of the densities.
The results apply to non-local Dirichlet transport, suggesting an underlying entropy gradient flow.
Abstract
Consider the Monge-Kantorovich problem of transporting densities to on with a strictly convex cost function. A popular relaxation of the problem is the one-parameter family called the entropic cost problem. The entropic cost , , is significantly faster to compute and is known to converge to the optimal transport cost as goes to zero. We are interested the rate of convergence. We show that the difference between and 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 with respect to a Riemannian volume measure on that measures the local sensitivity of the transport map. For the quadratic Wasserstein transport, this relative entropy is exactly one…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric Analysis and Curvature Flows · Geometry and complex manifolds · Nonlinear Partial Differential Equations
