Related papers: Linearization of Monge-Amp\`ere Equations and Stat…
We prove existence and uniqueness results for solutions to a class of optimal transportation problems with infinitely many marginals, supported on the real line. We also provide a characterization of the solution with an explicit formula.…
We consider optimal transport problems where the cost for transporting a given probability measure $\mu_0$ to another one $\mu_1$ consists of two parts: the first one measures the transportation from $\mu_0$ to an intermediate (pivot)…
In this series of lectures we introduce the Monge-Kantorovich problem of optimally transporting one distribution of mass onto another, where optimality is measured against a cost function c(x,y). Connections to geometry, inequalities, and…
We study a multi-marginal optimal transportation problem on a Riemannian manifold, with cost function given by the average distance squared from multiple points to their barycenter. Under a standard regularity condition on the first…
We formulate and solve a class of finite-time transport and mixing problems in the set-oriented framework. The aim is to obtain optimal discrete-time perturbations in nonlinear dynamical systems to transport a specified initial measure on…
We consider the Monge-Kantorovich optimal transportation problem between two measures, one of which is a weighted sum of Diracs. This problem is traditionally solved using expensive geometric methods. It can also be reformulated as an…
Let $\Omega\subset \R^n$ be a bounded convex domain and $\phi\in C(\bar\Omega)$ be a convex function such that $\phi$ is sufficiently smooth on $\partial\Omega$ and the Monge--Amp\`ere measure $\det D^2\phi$ is bounded away from zero and…
Given a smooth Riemannian manifold $(M,g)$, compact and without boundary, we analyze the dynamical optimal mass transport problem where the cost is given by the sum of the kinetic energy and the relative entropy with respect to a reference…
Sampling-based motion planners have proven to be efficient solutions to a variety of high-dimensional, geometrically complex motion planning problems with applications in several domains. The traditional view of these approaches is that…
We present a generalized optimal transport model in which the mass-preserving constraint for the $L^2$-Wasserstein distance is relaxed by introducing a source term in the continuity equation. The source term is also incorporated in the path…
Let (X,L) be a (semi-) polarized complex projective variety and T a real torus acting holomorphically on X with moment polytope P. Given a probability density g on P we introduce a new type of Monge-Ampere measure on X, defined for singular…
We prove that, for general cost functions on $\mathbb{R}^n$, or for the cost $d^2/2$ on a Riemannian manifold, optimal transport maps between smooth densities are always smooth outside a closed singular set of measure zero.
Optimal transport (OT) is a powerful geometric tool used to compare and align probability measures following the least effort principle. Despite its widespread use in machine learning (ML), OT problem still bears its computational burden,…
In this note we revisit previous Pogorelov type interior and global second derivative estimates of the author, F. Jiang and J. Liu for solutions of Monge-Amp`ere type partial differential equations. Taking account of recent strict convexity…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We consider Monge-Kantorovich optimal transport problems on $\mathbb{R}^d$, $d\ge 1$, with a convex cost function given by the cumulant generating function of a probability measure. Examples include the Wasserstein-2 transport whose cost…
Flow-based methods for sampling and generative modeling use continuous-time dynamical systems to represent a {transport map} that pushes forward a source measure to a target measure. The introduction of a time axis provides considerable…
We propose a volumetric formulation for computing the Optimal Transport problem defined on surfaces in $\mathbb{R}^3$, found in disciplines like optics, computer graphics, and computational methodologies. Instead of directly tackling the…
Entropic optimal transport offers a computationally tractable approximation to the classical problem. In this note, we study the approximation rate of the entropic optimal transport map (in approaching the Brenier map) when the…
By constructing appropriate smooth, possibly non-convex supersolutions, we establish sharp lower bounds near the boundary for the modulus of nontrivial solutions to singular and degenerate Monge-Amp\`ere equations of the form $\det D^2 u…