Papers
Topics
Authors
Recent
2000 character limit reached

Entropic Selection Principle for Monge's Optimal Transport (2502.16370v1)

Published 22 Feb 2025 in math.PR, math.AP, math.DG, and math.OC

Abstract: We investigate the small regularization limit of entropic optimal transport when the cost function is the Euclidean distance in dimensions $d > 1$, and the marginal measures are absolutely continuous with respect to the Lebesgue measure. Our results establish that the limiting optimal transport plan is supported on transport rays. Furthermore, within each transport ray, the limiting transport plan uniquely minimizes a relative entropy functional with respect to specific reference measures supported on the rays. This provides a complete and unique characterization of the limiting transport plan. While similar results have been obtained for $d = 1$ in \cite{Marino} and for discrete measures in \cite{peyr\'e2020computationaloptimaltransport}, this work resolves the previously open case in higher dimensions $d>1.$

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.