Related papers: Relative Optimal Transport
We discuss a relationship between rate-distortion and optimal transport (OT) theory, even though they seem to be unrelated at first glance. In particular, we show that a function defined via an extremal entropic OT distance is equivalent to…
We show that, on a $2$-dimensional compact manifold, the optimal transport map in the semi-discrete random matching problem is well-approximated in the $L^2$-norm by identity plus the gradient of the solution to the Poisson problem $-\Delta…
We generalize a well-known result of L. Caffarelli on Lipschitz estimates for optimal transportation $T$ between uniformly log-concave probability measures. Let $T : \R^d \to \R^d$ be an optimal transportation pushing forward $\mu =…
Optimal transportation theory and the related $p$-Wasserstein distance ($W_p$, $p\geq 1$) are widely-applied in statistics and machine learning. In spite of their popularity, inference based on these tools has some issues. For instance, it…
We develop the theory of a metric, which we call the $\nu$-based Wasserstein metric and denote by $W_\nu$, on the set of probability measures $\mathcal P(X)$ on a domain $X \subseteq \mathbb{R}^m$. This metric is based on a slight…
We address optimal control problems on the space of measures for an objective containing a smooth functional and an optimal transport regularization. That is, the quadratic Monge-Kantorovich distance between a given prior measure and the…
We consider the Monge-Kantorovich transport problem in a purely measure theoretic setting, i.e. without imposing continuity assumptions on the cost function. It is known that transport plans which are concentrated on c-monotone sets are…
The function that maps a family of probability measures to the solution of the dual entropic optimal transport problem is known as the Schr\"odinger map. We prove that when the cost function is $\mathcal{C}^{k+1}$ with $k\in \mathbb{N}^*$…
We consider symmetric multi-marginal Kantorovich optimal transport problems on finite state spaces with uniform-marginal constraint. These problems consist of minimizing a linear objective function over a high-dimensional polytope, here…
We study the Bergman determinantal point process from a theoretical point of view motivated by its simulation. We construct restricted and restricted-truncated variants of the Bergman kernel and show optimal transport inequalities involving…
In this paper, we give a new characterization of the cut locus of a point on a compact Riemannian manifold as the zero set of the optimal transport density solution of the Monge-Kantorovich equations, a PDE formulation of the optimal…
We consider an $L^2$-Wasserstein type distance $\rho$ on the configuration space $\Gamma_X$ over a Riemannian manifold $X$, and we prove that $\rho$-Lipschitz functions are contained in a Dirichlet space associated with a measure on…
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.…
We investigate the problem of pairwise multi-marginal optimal transport, that is, given a collection of probability distributions $\{P_\alpha\}$ on a Polish space $\mathcal{X}$, to find a coupling $\{X_\alpha\}$, $X_\alpha\sim P_\alpha$,…
Computing optimal transport (OT) between measures in high dimensions is doomed by the curse of dimensionality. A popular approach to avoid this curse is to project input measures on lower-dimensional subspaces (1D lines in the case of…
In this paper we characterize the so called uniformly rectifiable sets of David and Semmes in terms of the Wasserstein distance $W_2$ from optimal mass transport. To obtain this result, we first prove a localization theorem for the distance…
The theory of optimal transport of probability measures has wide-ranging applications across a number of different fields, including concentration of measure, machine learning, Markov chains, and economics. The generalisation of optimal…
We establish novel quantitative stability results for optimal transport problems with respect to perturbations in the target measure. We provide explicit bounds on the stability of optimal transport potentials and maps, which are relevant…
We study the convergence of entropically regularized optimal transport to optimal transport. The main result is concerned with the convergence of the associated optimizers and takes the form of a large deviations principle quantifying the…
Optimal Transport has received much attention in Machine Learning as it allows to compare probability distributions by exploiting the geometry of the underlying space. However, in its original formulation, solving this problem suffers from…