Related papers: Quadratic optimal transportation problem with a po…
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…
We study a rather general class of optimal "ballistic" transport problems for matrix-valued measures. These problems naturally arise, in the spirit of \emph{Y. Brenier. Comm. Math. Phys. (2018) 364(2) 579-605}, from a certain dual…
A quadratic optimal transport metric on the set of probability measure over $\R^2$ is introduced. The quadratic cost is given by the euclidean norm on $\R^2$ associated to some well chosen symmetric positive matrix, which makes the metric…
We investigate the optimal transport problem between probability measures when the underlying cost function is understood to satisfy a least action principle, also known as a Lagrangian cost. These generalizations are useful when connecting…
The optimal transport problem is studied in the context of Lorentz-Finsler geometry. For globally hyperbolic Lorentz-Finsler spacetimes the first Kantorovich problem and the Monge problem are solved. Further the intermediate regularity of…
In this note we prove estimates for the average cost in the quadratic optimal transport problem on the two-dimensional flat torus which are optimal up to a double logarithm. We also prove sharp estimates on the displacement. This is based…
We consider an optimal transportation problem with more than two marginals. We use a family of semi-Riemannian metrics derived from the mixed, second order partial derivatives of the cost function to provide upper bounds for the dimension…
We consider the Monge-Kantorovich problem between two random measuress. More precisely, given probability measures $\mathbb{P}_1,\mathbb{P}_2\in\mathcal{P}(\mathcal{P}(M))$ on the space $\mathcal{P}(M)$ of probability measures on a smooth…
The duality theory 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:X\times…
The dual problem of optimal transportation in Lorentz-Finsler geometry is studied. It is shown that in general no solution exists even in the presence of an optimal coupling. Under natural assumptions dual solutions are established. It is…
We establish novel quantitative stability results for optimal transport problems with respect to perturbations in the target measure. We provide explicit bounds on the stability of optimal transport potentials and maps, which are relevant…
We present a numerical method to solve the optimal transport problem with a quadratic cost when the source and target measures are periodic probability densities. This method is based on a numerical resolution of the corresponding…
We consider an optimal transport problem on the unit simplex whose solutions are given by gradients of exponentially concave functions and prove two main results. First, we show that the optimal transport is the large deviation limit of a…
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…
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…
A simple procedure to map two probability measures in $\mathbb{R}^d$ is the so-called \emph{Knothe-Rosenblatt rearrangement}, which consists in rearranging monotonically the marginal distributions of the last coordinate, and then the…
We investigate the problem of pairwise multi-marginal optimal transport, that is, given a collection of probability distributions $\{P_\alpha\}$ on a Polish space $\mathcal{X}$, to find a coupling $\{X_\alpha\}$, $X_\alpha\sim P_\alpha$,…
Optimal mass transport is described by an approximation of transport cost via semi-discrete costs. The notions of optimal partition and optimal strong partition are given as well. We also suggest an algorithm for computation of Optimal…
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…
We consider maps $T$ solving the optimal transport problem with a cost $c(x-y)$ modeled on the $p$-cost. For H\"older continuous marginals, we prove a $C^{1,\alpha}$-partial regularity result for $T $in the set $\{|T(x)-x|>0\}$.