Related papers: Mode Collapse and Regularity of Optimal Transporta…
In this paper we consider the Benamou-Brenier formulation of optimal transport for nonlinear control affine systems on $\Rd$, removing the compactness assumption of the underlying manifold in previous work by the author. By using Bernard's…
We explore the geometry of the Bures-Wasserstein space for potentially degenerate Gaussian measures on a separable Hilbert space. In this general setting, the optimal transport map is formally the subgradient of a convex function that is…
Weak optimal transport generalizes the classical theory of optimal transportation to nonlinear cost functions and covers a range of problems that lie beyond the traditional theory - including entropic transport, martingale transport, and…
We investigate the small regularization limit of entropic optimal transport when the cost function is the Euclidean distance in dimensions $d > 1$, and the marginal measures are absolutely continuous with respect to the Lebesgue measure.…
Optimal transport maps define a one-to-one correspondence between probability distributions, and as such have grown popular for machine learning applications. However, these maps are generally defined on empirical observations and cannot be…
We consider a PDE approach to numerically solving the optimal transportation problem on the sphere. We focus on both the traditional squared geodesic cost and a logarithmic cost, which arises in the reflector antenna design problem. At each…
Quadratic regularization has emerged as a potential alternative to the popular entropic regularization in computational optimal transport, offering the theoretical advantage of producing sparse couplings through its hinge density structure.…
In this paper, we study flexibility of weak solutions to the Monge-Amp\`ere system (MA) via convex integration. This new system of Pdes is an extension of the Monge-Amp\`ere equation in $d=2$ dimensions, naturally arising from the…
We prove existence of an optimal transport map in the Monge-Kantorovich problem associated to a cost $c(x,y)$ which is not finite everywhere, but coincides with $|x-y|^2$ if the displacement $y-x$ belongs to a given convex set $C$ and it is…
We address the numerical solution via Galerkin type methods of the Monge-Amp\`ere equation with transport boundary conditions arising in optimal mass transport, geometric optics and computational mesh or grid movement techniques. This fully…
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 derive limit distributions for certain empirical regularized optimal transport distances between probability distributions supported on a finite metric space and show consistency of the (naive) bootstrap. In particular, we prove that the…
The aim of this article is to show that the Monge-Kantorovich problem is the limit of a sequence of entropy minimization problems when a fluctuation parameter tends down to zero. We prove the convergence of the entropic values to the…
We present a systematic study of conditional triangular transport maps in function spaces from the perspective of optimal transportation and with a view towards amortized Bayesian inference. More specifically, we develop a theory of…
In this paper, we study the regularity of optimal mappings in Monge's mass transfer problem. Using the approximation to Monge's cost function given by the Euclidean distance c(x,y)=dist(x,y) through the costs…
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…
It is well known that the quadratic-cost optimal transportation problem is formally equivalent to the second boundary value problem for the Monge-Amp\`ere equation. Viscosity solutions are a powerful tool for analysing and approximating…
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat…
This paper presents a novel two-step approach for the fundamental problem of learning an optimal map from one distribution to another. First, we learn an optimal transport (OT) plan, which can be thought as a one-to-many map between the two…
We consider the optimal transport problem over convex costs arising from optimal control of linear time-invariant(LTI) systems when the initial and target measures are assumed to be supported on the set of equilibrium points of the LTI…