Related papers: Optimal transportation, topology and uniqueness
Many problems in dynamic data driven modeling deals with distributed rather than lumped observations. In this paper, we show that the Monge-Kantorovich optimal transport theory provides a unifying framework to tackle such problems in the…
Multimarginal optimal transport (MOT) has gained increasing attention in recent years, notably due to its relevance in machine learning and statistics, where one seeks to jointly compare and align multiple probability distributions. This…
We introduce an optimal transport topology on the space of probability measures over a fiber bundle, which penalizes the transport cost from one fiber to another. For simplicity, we illustrate our construction in the Euclidean case…
We develop a theory of optimal transport relative to a distinguished subset, which acts as a reservoir of mass, allowing us to compare measures of different total variation. This relative transportation problem has an optimal solution and…
Some classical mass transportation problems are investigated in a finitely additive setting. Let $\Omega=\prod_{i=1}^n\Omega_i$ and $\mathcal{A}=\otimes_{i=1}^n\mathcal{A}_i$, where $(\Omega_i,\mathcal{A}_i,\mu_i)$ is a ($\sigma$-additive)…
We suggest a new way of defining optimal transport of positive-semidefinite matrix-valued measures. It is inspired by a recent rendering of the incompressible Euler equations and related conservative systems as concave maximization…
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…
We study optimal transportation problems with constraints on densities of transport plans. We obtain a sharp condition for the uniqueness of an optimal solution to the Kantorovich problem with density constraints, namely that the Borel…
The classical duality theory of Kantorovich and Kellerer for the classical optimal transport is generalized to an abstract framework and a characterization of the dual elements is provided. This abstract generalization is set in a Banach…
We present a general method, based on conjugate duality, for solving a convex minimization problem without assuming unnecessary topological restrictions on the constraint set. It leads to dual equalities and characterizations of the…
We consider a Kantorovich potential associated to an optimal transportation problem between measures that are not necessarily absolutely continuous with respect to the Lebesgue measure, but are comparable to the Lebesgue measure when…
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…
We study multi-marginal optimal transport problems from a probabilistic graphical model perspective. We point out an elegant connection between the two when the underlying cost for optimal transport allows a graph structure. In particular,…
Replacing positivity constraints by an entropy barrier is popular to approximate solutions of linear programs. In the special case of the optimal transport problem, this technique dates back to the early work of Schr\"odinger. This approach…
For a family of probability spaces $\{(X_k,\mathcal{B}_{X_k},\mu_k)\}_{k=1}^N$ and a cost function $c: X_1\times\cdots\times X_N\to \mathbb{R}$ we consider the Monge-Kantorovich problem \begin{align*}\tag{MK}\label{MONKANT}…
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…
In this note, we propose polynomial-time algorithms solving the Monge and Kantorovich formulations of the $\infty$-optimal transport problem in the discrete and finite setting. It is the first time, to the best of our knowledge, that…
The dual attainment of the Monge--Kantorovich transport problem is analyzed in a general setting. The spaces $X, Y$ are assumed to be polish and equipped with Borel probability measures $\mu$ and $\nu$. The transport cost function $c:\XY…
We introduce folded optimal transport, as a method to extend a cost or distance defined on the extreme boundary of a convex to the whole convex, related to convex extension. This construction broadens the framework of standard optimal…
The primary purpose of this note is to provide an instructional summary of the state of the art regarding cyclic monotonicity and related notions. We will also present how these notions are tied to optimality in the optimal transport (or…