2000 character limit reached
A proof of the Caffarelli contraction theorem via entropic regularization
Published 12 Apr 2019 in math.PR, math.FA, and math.OC | (1904.06053v1)
Abstract: We give a new proof of the Caffarelli contraction theorem, which states that the Brenier optimal transport map sending the standard Gaussian measure onto a uniformly log-concave probability measure is Lipschitz. The proof combines a recent variational characterization of Lipschitz transport map by the second author and Juillet with a convexity property of optimizers in the dual formulation of the entropy-regularized optimal transport (or Schr{\"o}dinger) problem.
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.