Related papers: $\mathcal{W}_\infty$-transport with discrete targe…
We study the notion of debiasability for cost functions arising in optimal transport. We call a symmetric cost function $c:\mathscr{X}\times\mathscr{X}\to\mathbb{R}\cup\{+\infty\}$ debiasable if it satisfies $c(x,y)\ge…
Consider transportation of one distribution of mass onto another, chosen to optimize the total expected cost, where cost per unit mass transported from x to y is given by a smooth function c(x,y). If the source density f^+(x) is bounded…
We study an optimal transport problem with a backward martingale constraint in a pseudo-Euclidean space $S$. We show that the dual problem consists in the minimization of the expected values of the Fitzpatrick functions associated with…
We study the equivalence between the weighted least gradient problem and the weighted Beckmann minimal flow problem or equivalently, the optimal transport problem with Riemannian cost. Thanks to this equivalence, we prove existence and…
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…
We analyze combinatorial optimization problems over a pair of random point sets of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set,…
We propose an entropic approximation approach for optimal transportation problems with a supremal cost. We establish $\Gamma$-convergence for suitably chosen parameters for the entropic penalization and that this procedure selects…
This paper is devoted to the stochastic approximation of entropically regularized Wasserstein distances between two probability measures, also known as Sinkhorn divergences. The semi-dual formulation of such regularized optimal…
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 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…
Partial graph matching extends traditional graph matching by allowing some nodes to remain unmatched, enabling applications in more complex scenarios. However, this flexibility introduces additional complexity, as both the subset of nodes…
We study an optimal weak transport cost related to the notion of convex order between probability measures. On the real line, we show that this weak transport cost is reached for a coupling that does not depend on the underlying cost…
The Wasserstein distance $\mathcal{W}_p$ is an important instance of an optimal transport cost. Its numerous mathematical properties as well as applications to various fields such as mathematical finance and statistics have been well…
Two probability distributions $\mu$ and $\nu$ in second stochastic order can be coupled by a supermartingale, and in fact by many. Is there a canonical choice? We construct and investigate two couplings which arise as optimizers for…
The \emph{interestingness score} of a directed path $\Pi = e_1, e_2, e_3, \dots, e_\ell$ in an edge-weighted directed graph $G$ is defined as $\texttt{score}(\Pi) := \sum_{i=1}^\ell w(e_i) \cdot \log{(i+1)}$, where $w(e_i)$ is the weight of…
A remarkable connection between optimal design and Monge transport was initiated in the years 1997 in the context of the minimal elastic compliance problem and where the euclidean metric cost was naturally involved. In this paper we present…
A data-driven formulation of the optimal transport problem is presented and solved using adaptively refined meshes to decompose the problem into a sequence of finite linear programming problems. Both the marginal distributions and their…
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolation lemma as described in (Mulmuley et al. 1987) achieves the…
Optimal transport (OT) is a powerful tool for measuring the distance between two defined probability distributions. In this paper, we develop a new manifold named the coupling matrix manifold (CMM), where each point on CMM can be regarded…
Optimal transport is the problem of designing a joint distribution for two random variables with fixed marginals. In virtually the entire literature on this topic, the objective is to minimize expected cost. This paper is the first to study…