Related papers: Geometric linearisation for optimal transport with…
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
Optimal transport is a geometrically intuitive, robust and flexible metric for sample comparison in data analysis and machine learning. Its formal Riemannian structure allows for a local linearization via a tangent space approximation. This…
Optimal maps, solutions to the optimal transportation problems, are completely determined by the corresponding c-convex potential functions. In this paper, we give simple sufficient conditions for a smooth function to be c-convex when the…
In this paper, we consider the Monge optimal transport problem with distance cost. We prove that in some metric spaces, possibly with many branching geodesics, an optimal transport map exists if the first marginal is absolutely continuous.…
We rephrase Monge's optimal transportation (OT) problem with quadratic cost--via a Monge-Amp\`ere equation--as an infinite-dimensional optimization problem, which is in fact a convex problem when the target is a log-concave measure with…
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…
Optimal transport from the volume measure to a convex combination of Dirac measures yields a tessellation of a Riemannian manifold into pieces of arbitrary relative size. This tessellation is studied for the cost functions…
We prove existence of an optimal transport map in the Monge-Kantorovich problem associated to a cost $c(x,y)$ which is not finite everywhere, but coincides with $|x-y|^2$ if the displacement $y-x$ belongs to a given convex set $C$ and it is…
We investigate the small regularization limit of entropic optimal transport when the cost function is the Euclidean distance in dimensions $d > 1$, and the marginal measures are absolutely continuous with respect to the Lebesgue measure.…
In this paper, we prove existence of $L^p$-optimal transport maps with $p \in (1,\infty)$ in a class of branching metric spaces defined on $\mathbb{R}^N$. In particular, we introduce the notion of cylinder-like convex function and we prove…
An optimal transport problem on finite spaces is a linear program. Recently, a relaxation of the optimal transport problem via strictly convex functions, especially via the Kullback--Leibler divergence, sheds new light on data sciences.…
We investigate in this work a versatile convex framework for multiple image segmentation, relying on the regularized optimal mass transport theory. In this setting, several transport cost functions are considered and used to match…
In recent works - both experimental and theoretical - it has been shown how to use computational geometry to efficently construct approximations to the optimal transport map between two given probability measures on Euclidean space, by…
In this work, we show the intrinsic relations between optimal transportation and convex geometry, especially the variational approach to solve Alexandrov problem: constructing a convex polytope with prescribed face normals and volumes. This…
In this work, we construct a novel numerical method for solving the multi-marginal optimal transport problems with Coulomb cost. This type of optimal transport problems arises in quantum physics and plays an important role in understanding…
We study the optimal transport problem in the Euclidean space where the cost function is given by the value function associated with a Linear Quadratic minimization problem. Under appropriate assumptions, we generalize Brenier's Theorem…
In order to circumvent the difficulties in solving numerically the discrete optimal transport problem, in which one minimizes the linear target function $P\mapsto\langle C,P\rangle:=\sum_{i,j}C_{ij}P_{ij}$, Cuturi introduced a variant of…
In this paper we consider a mass optimization problem in the case of scalar state function, where instead of imposing a constraint on the total mass of the competitors, we penalize the classical compliance by a convex functional defined on…
This paper is devoted to the study of couplings of the Lebesgue measure and the Poisson point process. We prove existence and uniqueness of an optimal coupling whenever the asymptotic mean transportation cost is finite. Moreover, we give…