Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 81 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 22 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 81 tok/s Pro
Kimi K2 172 tok/s Pro
GPT OSS 120B 434 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Uniform large-scale $\varepsilon$-regularity for entropic optimal transport (2501.07539v1)

Published 13 Jan 2025 in math.AP and math.PR

Abstract: We study the regularity properties of the minimisers of entropic optimal transport providing a natural analogue of the $\varepsilon$-regularity theory of quadratic optimal transport in the entropic setting. More precisely, we show that if the minimiser of the entropic problem satisfies a gradient BMO-type estimate at some scale, the same estimate holds all the way down to the natural length-scale associated to the entropic regularisation. Our result follows from a more general $\varepsilon$-regularity theory for optimal transport costs which can be viewed as perturbations of quadratic optimal transport. We consider such a perturbed cost and require that, under a certain class of admissible affine rescalings, the minimiser remains a local quasi-minimiser of the quadratic problem (in an appropriate sense) and that the cost of "long trajectories" of minimisers (and their rescalings) is small. Under these assumptions, we show that the minimiser satisfies an appropriate $C{2,\alpha}$ Morrey$\unicode{x2013}$Campanato-type estimate which is valid up to the scale of quasi-minimality.

Summary

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

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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