Related papers: Wasserstein distance on configuration space
We explore the geometry of the Bures-Wasserstein space for potentially degenerate Gaussian measures on a separable Hilbert space. In this general setting, the optimal transport map is formally the subgradient of a convex function that is…
In this paper we study two basic facts of optimal transportation on Wiener space W. Our first aim is to answer to the Monge Problem on the Wiener space endowed with the Sobolev type norm (k,gamma) to the power of p (cases p = 1 and p > 1…
We use Stein's method to bound the Wasserstein distance of order $2$ between a measure $\nu$ and the Gaussian measure using a stochastic process $(X_t)_{t \geq 0}$ such that $X_t$ is drawn from $\nu$ for any $t > 0$. If the stochastic…
We propose a new generalization to quantum states of the Wasserstein distance, which is a fundamental distance between probability distributions given by the minimization of a transport cost. Our proposal is the first where the transport…
The presentation covers prerequisite results from Topology and Measure Theory. This is then followed by an introduction into couplings and basic definitions for optimal transport. The Kantrorovich problem is then introduced and an existence…
This paper studies iterative schemes for measure transfer and approximation problems, which are defined through a slicing-and-matching procedure. Similar to the sliced Wasserstein distance, these schemes benefit from the availability of…
In this paper, we remark that any optimal coupling for the quadratic Wasserstein distance $W^2_2(\mu,\nu)$ between two probability measures $\mu$ and $\nu$ with finite second order moments on $\mathbb{R}^d$ is the composition of a…
A novel framework for density estimation under expectation constraints is proposed. The framework minimizes the Wasserstein distance between the estimated density and a prior, subject to the constraints that the expected value of a set of…
We provide a framework to approximate the 2-Wasserstein distance and the optimal transport map, amenable to efficient training as well as statistical and geometric analysis. With the quadratic cost and considering the Kantorovich dual form…
The Monge-Kantorovich problem for the infinite Wasserstein distance presents several peculiarities. Among them the lack of convexity and then of a direct duality. We study in dimension 1 the dual problem introduced by Barron, Bocea and…
We investigate the optimal mass transport problem associated to the following "ballistic" cost functional on phase space $M\times M^*$, $$ b_T(v, x):=\inf\{\langle v, \gamma (0)\rangle +\int_0^TL(\gamma (t), {\dot \gamma}(t))\, dt, \gamma…
We introduce the observable Wasserstein distance, a framework for deriving lower bounds on the Wasserstein distance between probability measures on Polish metric spaces, designed to bypass the computational intractability of exact optimal…
Computing the infinity Wasserstein distance and retrieving projections of a probability measure onto a closed subset of probability measures are critical sub-problems in various applied fields. However, the practical applicability of these…
We introduce a new technique, which we call the boundary method, for solving semi-discrete optimal transport problems with a wide range of cost functions. The boundary method reduces the effective dimension of the problem, thus improving…
We give an easy counter-example to Problem 7.20 from C. Villani's book on mass transport: in general, the quadratic Wasserstein distance between $n$-fold normalized convolutions of two given measures fails to decrease monotonically.
Optimal transport is widely used to learn distributions, enforce distributional constraints, and model uncertainty. In applications, transport losses are often computed from samples through tractable representations, such as one-dimensional…
We analyze the sensitivity of solutions to the Fokker-Planck equation with respect to some unknown parameter. Our main result is to provide quantitative upper bounds for the $p$-Wasserstein distance $\mathcal{W}_p$ between two solutions…
The discrete Wasserstein barycenter problem is a minimum-cost mass transport problem for a set of probability measures with finite support. In this paper, we show that finding a barycenter of sparse support is hard, even in dimension 2 and…
Persistence diagrams are a useful tool from topological data analysis which can be used to provide a concise description of a filtered topological space. What makes them even more useful in practice is that they come with a notion of a…
We discuss the classical problem of measuring the regularity of distribution of sets of $N$ points in $\mathbb{T}^d$. A recent line of investigation is to study the cost ($=$ mass $\times$ distance) necessary to move Dirac measures placed…