Related papers: Global estimates on the Brenier map
Caffarelli's contraction theorem states that the Brenier optimal transport map from the standard Gaussian measure to a more log-concave probability measure is 1-Lipschitz. Owing to its many applications in analysis, probability, and…
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…
We prove global Lipschitz estimates for Brenier maps between probability measures on $\mathbb{R}^n$ whose densities belong to the family $$ \rho_{U,\,p}=Z_{U,\, p}^{-1}\exp(-\Theta_p(U)), \qquad \Theta_p(t)=p\log\Bigl(1+\frac{t}{p}\Bigr),…
Caffarelli's contraction theorem states that probability measures with uniformly logconcave densities on R d can be realized as the image of a standard Gaussian measure by a globally Lipschitz transport map. We discuss some counterexamples…
Caffarelli's contraction theorem bounds the derivative of the optimal transport map between a log-convex measure and a strongly log-concave measure. We show that an analogous phenomenon holds on the level of the trace: The trace of the…
The optimal transport map between the standard Gaussian measure and an $\alpha$-strongly log-concave probability measure is $\alpha^{-1/2}$-Lipschitz, as first observed in a celebrated theorem of Caffarelli. In this paper, we apply two…
In this paper, we extend the scope of Caffarelli's contraction theorem, which provides a measure of the Lipschitz constant for optimal transport maps between log-concave probability densities in $\R^d$. Our focus is on a broader category of…
We give a characterization of optimal transport plans for a variant of the usual quadratic transport cost introduced in [33]. Optimal plans are composition of a deterministic transport given by the gradient of a continuously differentiable…
We give an alternative proof and some extensions of results of Carlier, Figalli and Santambrogio on polynomial upper bounds on the Brenier map between probability measures under various conditions on the densities. The proofs are based on…
A theorem of L. Caffarelli implies the existence of a map pushing forward a source Gaussian measure to a target measure which is more log-concave than the source one, which contracts Euclidean distance (in fact, Caffarelli showed that the…
We investigate the Brenier map $\nabla \Phi$ between the uniform measures on two convex domains in $\mathbb{R}^n$ or more generally, between two log-concave probability measures on $\mathbb{R}^n$. We show that the eigenvalues of the Hessian…
We give curvature-dependant convergence rates for the optimization of weakly convex functions defined on a manifold of 1-bounded geometry via Riemannian gradient descent and via the dynamic trivialization algorithm. In order to do this, we…
Maximum likelihood estimation of a log-concave probability density is formulated as a convex optimization problem and shown to have an equivalent dual formulation as a constrained maximum Shannon entropy problem. Closely related maximum…
We introduce and analyze a statistical estimator for Monge transport maps: solutions to the quadratic optimal transport problem in Euclidean space. For absolutely continuous source measures, this map is uniquely defined as the gradient of a…
We introduce a compositional framework for convex analysis based on the notion of convex bifunction of Rockafellar. This framework is well-suited to graphical reasoning, and exhibits rich dualities such as the Legendre-Fenchel transform,…
One of the central objects in the theory of optimal transport is the Brenier map: the unique monotone transformation which pushes forward an absolutely continuous probability law onto any other given law. A line of recent work has analyzed…
We establish $C^{2,\alpha}$ estimates for PDE of the form convex $+$ a sum of weakly concave functions of the Hessian, thus generalising a recent result of Collins which is in turn inspired by a theorem of Caffarelli and Yuan.…
Bayesian inference requires approximation methods to become computable, but for most of them it is impossible to quantify how close the approximation is to the true posterior. In this work, we present a theorem upper-bounding the KL…
To learn (statistical) dependencies among random variables requires exponentially large sample size in the number of observed random variables if any arbitrary joint probability distribution can occur. We consider the case that sparse data…
We provide a framework to approximate the 2-Wasserstein distance and the optimal transport map, amenable to efficient training as well as statistical and geometric analysis. With the quadratic cost and considering the Kantorovich dual form…