Related papers: Folded optimal transport and its application to se…
We propose a new algorithm that uses an auxiliary neural network to express the potential of the optimal transport map between two data distributions. In the sequel, we use the aforementioned map to train generative networks. Unlike WGANs,…
Sliced optimal transport, which is basically a Radon transform followed by one-dimensional optimal transport, became popular in various applications due to its efficient computation. In this paper, we deal with sliced optimal transport on…
In this paper we investigate the numerical approximation of an analogue of the Wasserstein distance for optimal transport on graphs that is defined via a discrete modification of the Benamou--Brenier formula. This approach involves the…
The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamics formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE…
In this paper, we prove a structure theorem for discrete optimal transportation plans. We show that, given any pair of discrete probability measures and a cost function, there exists an optimal transportation plan that can be expressed as…
Two geometrical structures have been extensively studied for a manifold of probability distributions. One is based on the Fisher information metric, which is invariant under reversible transformations of random variables, while the other is…
We show continuity of the martingale optimal transport optimisation problem as a functional of its marginals. This is achieved via an estimate on the projection in the nested/causal Wasserstein distance of an arbitrary coupling on to the…
We define the quantum Wasserstein distance such that the optimization of the coupling is carried out over bipartite separable states rather than bipartite quantum states in general, and examine its properties. Surprisingly, we find that the…
A result of Hohloch links the theory of integer partitions with the Monge formulation of the optimal transport problem, giving the optimal transport map between (Young diagrams of) integer partitions and their corresponding symmetric…
The function that maps a family of probability measures to the solution of the dual entropic optimal transport problem is known as the Schr\"odinger map. We prove that when the cost function is $\mathcal{C}^{k+1}$ with $k\in \mathbb{N}^*$…
For probability measures on a complete separable metric space, we present sufficient conditions for the existence of a solution to the Kantorovich transportation problem. We also obtain sufficient conditions (which sometimes also become…
We study optimal transportation of measures on compact manifolds for costs defined from convex Lagrangians. We prove that optimal transportation can be interpolated by measured Lipschitz laminations, or geometric currents. The methods are…
We revisit the optimal transport problem over angular velocity dynamics given by the controlled Euler equation. The solution of this problem enables stochastic guidance of spin states of a rigid body (e.g., spacecraft) over a hard deadline…
This is the first part of a general description in terms of mass transport for time-evolving interacting particles systems, at a mesoscopic level. Beyond kinetic theory, our framework naturally applies in biology, computer vision, and…
We consider an optimal transport problem between laws of random probability measures: given a base cost function, we build the associated OT cost between probability measures that in turn we use to define the OT cost between probability…
In this paper, we give a new characterization of the cut locus of a point on a compact Riemannian manifold as the zero set of the optimal transport density solution of the Monge-Kantorovich equations, a PDE formulation of the optimal…
Classical optimal transport problem seeks a transportation map that preserves the total mass betwenn two probability distributions, requiring their mass to be the same. This may be too restrictive in certain applications such as color or…
We generalize a well-known result of L. Caffarelli on Lipschitz estimates for optimal transportation $T$ between uniformly log-concave probability measures. Let $T : \R^d \to \R^d$ be an optimal transportation pushing forward $\mu =…
A remarkable connection between optimal design and Monge transport was initiated in the years 1997 in the context of the minimal elastic compliance problem and where the euclidean metric cost was naturally involved. In this paper we present…
It is known from clever mathematical examples \cite{Ca10} that the Monge ansatz may fail in continuous two-marginal optimal transport (alias optimal coupling alias optimal assignment) problems. Here we show that this effect already occurs…