Related papers: Optimal transportation of measures with a paramete…
We study a multi-marginal optimal transportation problem on a Riemannian manifold, with cost function given by the average distance squared from multiple points to their barycenter. Under a standard regularity condition on the first…
In this paper, we study optimal transportation problems for multifractal random measures. Since these measures are much less regular than optimal transportation theory requires, we introduce a new notion of transportation which is…
A common way to quantify the ,,distance'' between measures is via their discrepancy, also known as maximum mean discrepancy (MMD). Discrepancies are related to Sinkhorn divergences $S_\varepsilon$ with appropriate cost functions as…
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…
The stability of optimal transport maps with respect to perturbations of the marginals is a question of interest for several reasons, ranging from the justification of the linearized optimal transport framework to numerical analysis and…
We consider the Monge-Kantorovich transport problem in a purely measure theoretic setting, i.e. without imposing continuity assumptions on the cost function. It is known that transport plans which are concentrated on c-monotone sets are…
We approach the problem of constructing a quantum analogue of the immensely fruitful classical transport cost theory of Monge from a new angle. Going back to the original motivations, by which the transport is a bilinear function of a mass…
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…
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}^*$…
In many scientific fields imaging is used to relate a certain physical quantity to other dependent variables. Therefore, images can be considered as a map from a real-world coordinate system to the non-negative measurements being acquired.…
We propose deep learning methods for classical Monge's optimal mass transportation problems, where where the distribution constraint is treated as penalty terms defined by the maximum mean discrepancy in the theory of Hilbert space…
Let M and \bar M be n-dimensional manifolds equipped with suitable Borel probability measures \rho and \bar\rho. Ma, Trudinger & Wang gave sufficient conditions on a transportation cost c \in C^4(M \times \bar M) to guarantee smoothness of…
We study the optimal transport problem in sub-Riemannian manifolds where the cost function is given by the square of the sub-Riemannian distance. Under appropriate assumptions, we generalize Brenier-McCann's Theorem proving existence and…
We study the problem of maximizing a spectral risk measure of a given output function which depends on several underlying variables, whose individual distributions are known but whose joint distribution is not. We establish and exploit an…
We investigate here the optimal transportation problem on configuration space for the quadratic cost. It is shown that, as usual, provided that the corresponding Wasserstein is finite, there exists one unique optimal measure and that 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 study the convergence of the transport plans $\gamma_\epsilon$ towards $\gamma_0$ as well as the cost of the entropy-regularized optimal transport $(c,\gamma_\epsilon)$ towards $(c,\gamma_0)$ as the regularization parameter $\epsilon$…
We consider optimal transport problems where the cost for transporting a given probability measure $\mu_0$ to another one $\mu_1$ consists of two parts: the first one measures the transportation from $\mu_0$ to an intermediate (pivot)…
We give a necessary and sufficient condition on the cost function so that the map solution of Monge's optimal transportation problem is continuous for arbitrary smooth positive data. This condition was first introduced by Ma, Trudinger and…
This paper studies the uniqueness of solutions to the dual optimal transport problem, both qualitatively and quantitatively (bounds on the diameter of the set of optimisers). On the qualitative side, we prove that when one marginal…