Related papers: Entropic Optimal Transport: Geometry and Large Dev…
Entropic regularization provides a generalization of the original optimal transport problem. It introduces a penalty term defined by the Kullback-Leibler divergence, making the problem more tractable via the celebrated Sinkhorn algorithm.…
This note exposes the differential topology and geometry underlying some of the basic phenomena of optimal transportation. It surveys basic questions concerning Monge maps and Kantorovich measures: existence and regularity of the former,…
We describe some analogy between optimal transport and the Schr\"odinger problem where the transport cost is replaced by an entropic cost with a reference path measure. A dual Kantorovich type formulation and a Benamou-Brenier type…
This paper studies the geometry of the optimizer for the optimal transport problem with capacity constraints. We introduce the concept of c-capacity monotonicity, which is a generalization of c-cyclical monotonicity in optimal transport. We…
We study the entropic regularizations of optimal transport problems under suitable summability assumptions on the point-wise transport cost. These summability assumptions already appear in the literature. However, we show that the weakest…
A probabilistic method for solving the Monge-Kantorovich mass transport problem on $R^d$ is introduced. A system of empirical measures of independent particles is built in such a way that it obeys a doubly indexed large deviation principle…
Entropic regularization is a method for large-scale linear programming. Geometrically, one traces intersections of the feasible polytope with scaled toric varieties, starting at the Birch point. We compare this to log-barrier methods, with…
In the classical Monge-Kantorovich problem, the transportation cost only depends on the amount of mass sent from sources to destinations and not on the paths followed by this mass. Thus, it does not allow for congestion effects. Using the…
We study the stability of entropically regularized optimal transport with respect to the marginals. Lipschitz continuity of the value and H\"older continuity of the optimal coupling in $p$-Wasserstein distance are obtained under general…
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…
We introduce a new class of convex-regularized Optimal Transport losses, which generalizes the classical Entropy-regularization of Optimal Transport and Sinkhorn divergences, and propose a generalized Sinkhorn algorithm. Our framework…
In this paper, we show a large deviation principle for certain sequences of static Schr\"{o}dinger bridges, typically motivated by a scale-parameter decreasing towards zero, extending existing large deviation results to cover a wider range…
We study optimal transport between probability measures supported on the same finite metric space, where the ground cost is a distance induced by a weighted connected graph. Building on recent work showing that the resulting Kantorovich…
We consider the problem of minimizing the entropy of a law with respect to the law of a reference branching Brownian motion under density constraints at an initial and final time. We call this problem the branching Schr\"odinger problem by…
The aim of this article is to show that the Monge-Kantorovich problem is the limit of a sequence of entropy minimization problems when a fluctuation parameter tends down to zero. We prove the convergence of the entropic values to the…
We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…
In the recent years the Schr\"odinger problem has gained a lot of attention because of the connection, in the small-noise regime, with the Monge-Kantorovich optimal transport problem. Its optimal value, the \emph{entropic cost}…
We develop a general approach to prove global regularity estimates for quadratic optimal transport using the entropic regularisation of the problem and the Prekopa-Leindler inequality.
We consider the entropic regularization of discretized optimal transport and propose to solve its optimality conditions via a logarithmic Newton iteration. We show a quadratic convergence rate and validate numerically that the method…