Related papers: A Brief on Optimal Transport
In this work we prove the existence and uniqueness of the optimal transport map for $L^p$-Wasserstein distance with $p>1$, and particularly present an explicit expression of the optimal transport map for the case $p=2$. As an application,…
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…
A solution of the free Schr\"odinger equation is investigated by means of Optimal transport. The curve of probability measures $\mu_t$ this solution defines is shown to be an absolutely continuous curve in the Wasserstein space…
Optimal transport (OT) provides effective tools for comparing and mapping probability measures. We propose to leverage the flexibility of neural networks to learn an approximate optimal transport map. More precisely, we present a new and…
The classical Kantorovich-Rubinstein duality theorem establishes a significant connection between Monge optimal transport and maximization of a linear form on the set of 1-Lipschitz functions. This result has been widely used in various…
In this paper, we introduce a variant of optimal transport adapted to the causal structure given by an underlying directed graph $G$. Different graph structures lead to different specifications of the optimal transport problem. For…
We prove a new version of Egorov's theorem formulated in the Schr\"{o}dinger picture of quantum mechanics, using the $p$-Wasserstein metric applied to the Husimi functions of quantum states. The special case $p=1$ corresponds to a…
We develop and study a theory of optimal transport for vector measures. We resolve in the negative a conjecture of Klartag, that given a vector measure on Euclidean space with total mass zero, the mass of any transport set is again zero. We…
In this paper, we present a novel and principled approach to learn the optimal transport between two distributions, from samples. Guided by the optimal transport theory, we learn the optimal Kantorovich potential which induces the optimal…
Information geometry and optimal transport are two distinct geometric frameworks for modeling families of probability measures. During the recent years, there has been a surge of research endeavors that cut across these two areas and…
We formulate and study an optimal transportation problem with infinitely many marginals; this is a natural extension of the multi-marginal problem studied by Gangbo and Swiech (1998). We prove results on the existence, uniqueness and…
Most common Optimal Transport (OT) solvers are currently based on an approximation of underlying measures by discrete measures. However, it is sometimes relevant to work only with moments of measures instead of the measure itself, and many…
This paper explores the controllability and state tracking of ensembles from the perspective of optimal transport theory. Ensembles, characterized as collections of systems evolving under the same dynamics but with varying initial…
In recent work arXiv:2109.07820 we have shown the equivalence of the widely used nonconvex (generalized) branched transport problem with a shape optimization problem of a street or railroad network, known as (generalized) urban planning…
The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently gained popularity in machine learning and statistics, as it makes feasible the use of smoothed optimal transportation distances for data…
The optimal transport (OT) map is a geometry-driven transformation between high-dimensional probability distributions which underpins a wide range of tasks in statistics, applied probability, and machine learning. However, existing…
We provide a unifying interpretation of various optimal transport problems as a minimisation of a linear functional over the set of all Choquet representations of a given pair of probability measures ordered with respect to a certain convex…
The optimal transportation problem, first suggested by Gaspard Monge in the 18th century and later revived in the 1940s by Leonid Kantorovich, deals with the question of transporting a certain measure to another, using transport maps or…
This paper is concerned by statistical inference problems from a data set whose elements may be modeled as random probability measures such as multiple histograms or point clouds. We propose to review recent contributions in statistics on…
Optimal transport (OT) is a powerful tool for measuring the distance between two defined probability distributions. In this paper, we develop a new manifold named the coupling matrix manifold (CMM), where each point on CMM can be regarded…