Related papers: Approximating the order 2 quantum Wasserstein dist…
We propose a new algorithm that uses an auxiliary neural network to express the potential of the optimal transport map between two data distributions. In the sequel, we use the aforementioned map to train generative networks. Unlike WGANs,…
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…
We introduce the optimal transportation interpretation of the Kantorovich norm on thespace of signed Radon measures with finite mass, based on a generalized Wasserstein distancefor measures with different masses.With the formulation and the…
This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…
In this paper, we define the generalized Wasserstein distance for sets of Borel probability measures and demonstrate that the weak convergence of sublinear expectations can be characterized by means of this distance.
This work establishes a framework for solving inverse boundary problems with the geodesic based quadratic Wasserstein distance ($W_{2}$). A general form of the Fr\'echet gradient is systematically derived by optimal transportation (OT)…
In his classical argument, Rao derives the Riemannian distance corresponding to the Fisher metric using a mapping between the space of positive measures and Euclidean space. He obtains the Hellinger distance on the full space of measures…
We propose in this paper a construction of a diffusion process on the Wasserstein space P\_2(R) of probability measures with a second-order moment. This process was introduced in several papers by Konarovskyi (see e.g. "A system of…
Given two n-dimensional measures $\mu$ and $\nu$ on Polish spaces, we propose an optimal transportation's formulation, inspired by classical Kan-torovitch's formulation in the scalar case. In particular, we established a strong duality…
As a natural approach to modeling system safety conditions, chance constraint (CC) seeks to satisfy a set of uncertain inequalities individually or jointly with high probability. Although a joint CC offers stronger reliability certificate,…
We study the behavior of the Wasserstein-$2$ distance between discrete measures $\mu$ and $\nu$ in $\mathbb{R}^d$ when both measures are smoothed by small amounts of Gaussian noise. This procedure, known as Gaussian-smoothed optimal…
We study optimization problems whereby the optimization variable is a probability measure. Since the probability space is not a vector space, many classical and powerful methods for optimization (e.g., gradients) are of little help. Thus,…
Variational problems that involve Wasserstein distances and more generally optimal transport (OT) theory are playing an increasingly important role in data sciences. Such problems can be used to form an examplar measure out of various…
In this paper, we address the classification of instances each characterized not by a singular point, but by a distribution on a vector space. We employ the Wasserstein metric to measure distances between distributions, which are then used…
Sinkhorn divergence is a measure of dissimilarity between two probability measures. It is obtained through adding an entropic regularization term to Kantorovich's optimal transport problem and can hence be viewed as an entropically…
We investigate here the optimal transportation problem on configuration space for the quadratic cost. It is shown that, as usual, provided that the corresponding Wasserstein is finite, there exists one unique optimal measure and that this…
Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…
The two-sample homogeneity testing problem is fundamental in statistics and becomes particularly challenging in high dimensions, where classical tests can suffer substantial power loss. We develop a learning-assisted procedure based on the…
The Wasserstein distance provides a notion of dissimilarities between probability measures, which has recent applications in learning of structured data with varying size such as images and text documents. In this work, we study the…
It is well known that the quadratic Wasserstein distance $W_2 (\mathord{\boldsymbol{\cdot}}, \mathord{\boldsymbol{\cdot}})$ is formally equivalent, for infinitesimally small perturbations, to some weighted $H^{-1}$ homogeneous Sobolev norm.…