2000 character limit reached
A regularized transportation cost stemming from entropic approximation (2501.03906v1)
Published 7 Jan 2025 in math.OC, math.AP, and math.PR
Abstract: We study the entropic regularizations of optimal transport problems under suitable summability assumptions on the point-wise transport cost. These summability assumptions already appear in the literature. However, we show that the weakest compactness conditions that can be derived are already enough to obtain the convergence of the regularized functionals. This approach allows us to characterize the variational limit of the regularization even when it does not converge to the original problem. The results apply also to problems with more than two marginals.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.