Related papers: Quantitative Uniqueness of Kantorovich Potentials
We develop a theory for image restoration with a learned regularizer that is analogous to that of Meyer's characterization of solutions of the classical variational method of Rudin-Osher-Fatemi (ROF). The learned regularizer we use is a…
An optimal transport path may be viewed as a geodesic in the space of probability measures under a suitable family of metrics. This geodesic may exhibit a tree-shaped branching structure in many applications such as trees, blood vessels,…
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 study the Kantorovich-Rubinstein transhipment problem when the difference between the source and the target is not anymore a balanced measure but belongs to a suitable subspace $X(\Omega)$ of first order distribution. A particular…
We study the problem of transporting one probability measure to another via an autonomous velocity field. We rely on tools from the theory of optimal transport. In one space-dimension, we solve a linear homogeneous functional equation to…
We consider an extension of the Monge-Kantorovitch optimal transportation problem. The mass is transported along a continuous semimartingale, and the cost of transportation depends on the drift and the diffusion coefficients of the…
We exhibit a surprising relationship between elliptic gradient systems of PDEs, multi-marginal Monge-Kantorovich optimal transport problem, and multivariable Hardy-Littlewood inequalities. We show that the notion of an orientable elliptic…
We study the general problem of Bayesian persuasion (optimal information design) with continuous actions and continuous state space in arbitrary dimensions. First, we show that with a finite signal space, the optimal information design is…
The distance and divergence of the probability measures play a central role in statistics, machine learning, and many other related fields. The Wasserstein distance has received much attention in recent years because of its distinctions…
Discrete flow matching, a recent framework for modeling categorical data, has shown competitive performance with autoregressive models. However, unlike continuous flow matching, the rectification strategy cannot be applied due to the…
In this paper we derive a moment relaxation for large-scale nonsmooth optimization problems with graphical structure and spherical constraints. In contrast to classical moment relaxations for global polynomial optimization that suffer from…
In Optimal Transport (OT) on a finite metric space, one defines a distance on the probability simplex that extends the distance on the ground space. The distance is the value of a Linear Programming (LP) problem on the set of…
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…
We study a dynamic optimal transport type problem on a domain that consists of two parts: a compact set $\Omega \subset \mathbb{R}^d$ (bulk) and a non-intersecting and sufficiently regular curve $\Gamma \subset \Omega$. On each of them, a…
This paper exploit the equivalence between the Schr\"odinger Bridge problem and the entropy penalized optimal transport in order to find a different approach to the duality, in the spirit of optimal transport. This approach results in a…
For the solution of the Gauss image problem for pseudo-cones, which can be considered as a measure transport problem for certain measures on the sphere, we give a new proof, using a special case of Kantorovich duality.
We consider the multi-marginal optimal transport of aligning several compactly supported marginals on the Heisenberg group to minimize the total cost, which we take to be the sum of the squared Carnot-Carath\'eodory distances from the…
We study dynamical optimal transport of discrete time systems (dDOT) with Lagrangian cost. The problem is approached by combining optimal control and Kantorovich duality theory. Based on the derived solution, a first order splitting…
The modeling of phenomenological structure is a crucial aspect in inverse imaging problems. One emerging modeling tool in computational imaging is the optimal transport framework. Its ability to model geometric displacements across an…
An upper bound for the Kantorovich transport distance between probability measures on multidimensional Euclidean spaces is given in terms of transport distances between one dimensional projections. This quantifies the Cram\'er-Wold…