Related papers: A large deviation approach to optimal transport
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…
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…
In this paper we study theoretical properties of the entropy-transport functional with repulsive cost functions. We provide sufficient conditions for the existence of a minimizer in a class of metric spaces and prove the…
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…
The Monge-Kantorovich mass transfer problem is equivalently formulated as a convex optimization problem for a potential function. In the light of this formulation an interative algorithm is developed for determining the solution. It is a…
Optimal transportation problem seeks for a coupling $\pi$ of two probability measures $\mu$ and $\nu$ which minimize the total cost $\int c d\pi$, which is linear in $\pi$. In this paper, we introduce a variation of optimal transportation…
We formulate a class of velocity-free finite-particle methods for mass transport problems based on a time-discrete incremental variational principle that combines entropy and the cost of particle transport, as measured by the Wasserstein…
The question of which costs admit unique optimizers in the Monge-Kantorovich problem of optimal transportation between arbitrary probability densities is investigated. For smooth costs and densities on compact manifolds, the only known…
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 machine learning and computer vision, optimal transport has had significant success in learning generative models and defining metric distances between structured and stochastic data objects, that can be cast as probability measures. The…
We formulate and solve a class of finite-time transport and mixing problems in the set-oriented framework. The aim is to obtain optimal discrete-time perturbations in nonlinear dynamical systems to transport a specified initial measure on…
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…
This note establishes that a generalization of $c$-cyclical monotonicity from the Monge-Kantorovich problem with two marginals gives rise to a sufficient condition for optimality also in the multi-marginal version of that problem. To obtain…
We study the convergence of an $N$-particle Markovian controlled system to the solution of a family of stochastic McKean-Vlasov control problems, either with a finite horizon or Schr\"odinger type cost functional. Specifically, under…
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…
In this article we show how ideas, methods and results from optimal transportation can be used to study various aspects of the stationary measuresof Iterated Function Systems equipped with a probability distribution. We recover a classical…
In the semi-discrete version of Monge's problem one tries to find a transport map $T$ with minimum cost from an absolutely continuous measure $\mu$ on $\mathbb{R}^d$ to a discrete measure $\nu$ that is supported on a finite set in…
In this paper, we study the optimal transport problem induced by separable cost functions. In this framework, transportation can be expressed as the composition of two lower-dimensional movements. Through this reformulation, we prove that…
We consider the optimal mass transportation problem in $\RR^d$ with measurably parameterized marginals, for general cost functions and under conditions ensuring the existence of a unique optimal transport map. We prove a joint measurability…
This paper is devoted to the study of the Monge-Kantorovich theory of optimal mass transport and its applications, in the special case of one-dimensional and circular distributions. More precisely, we study the Monge-Kantorovich distances…