Related papers: Structure preservation via the Wasserstein distanc…
We establish explicit bounds on the convex distance between the distribution of a vector of smooth functionals of a Gaussian field, and that of a normal vector with a positive definite covariance matrix. Our bounds are commensurate to the…
Motivated by the growing popularity of variants of the Wasserstein distance in statistics and machine learning, we study statistical inference for the Sliced Wasserstein distance--an easily computable variant of the Wasserstein distance.…
The goal of scenario reduction is to approximate a given discrete distribution with another discrete distribution that has fewer atoms. We distinguish continuous scenario reduction, where the new atoms may be chosen freely, and discrete…
The Wasserstein distance has been an attractive tool in many fields. But due to its high computational complexity and the phenomenon of the curse of dimensionality in empirical estimation, various extensions of the Wasserstein distance have…
We study the computational complexity of the optimal transport problem that evaluates the Wasserstein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in…
In this paper, for $\mu$ and $\nu$ two probability measures on $\mathbb{R}^d$ with finite moments of order $\rho\ge 1$, we define the respective projections for the $W_\rho$-Wasserstein distance of $\mu$ and $\nu$ on the sets of probability…
Generative networks have experienced great empirical successes in distribution learning. Many existing experiments have demonstrated that generative networks can generate high-dimensional complex data from a low-dimensional easy-to-sample…
We consider the problem of estimating the mean of a random vector based on $N$ independent, identically distributed observations. We prove the existence of an estimator that has a near-optimal error in all directions in which the variance…
Wasserstein geometry and information geometry are two important structures to be introduced in a manifold of probability distributions. Wasserstein geometry is defined by using the transportation cost between two distributions, so it…
In the setup of selling one or more goods, various papers have shown, in various forms and for various purposes, that a small change in the distribution of a buyer's valuations may cause only a small change in the possible revenue that can…
Given any closed Riemannian manifold $M$, we construct a reversible diffusion process on the space ${\mathcal P}(M)$ of probability measures on $M$ that is (i) reversible w.r.t.~the entropic measure ${\mathbb P}^\beta$ on ${\mathcal P}(M)$,…
Let $(M^n,g,f)$ be a Ricci shrinker such that $\textrm{Ric}_f=\frac{1}{2}g$ and the measure induced by the weighted volume element $(4\pi)^{-\frac{n}{2}}e^{-f}dv_{g}$ is a probability measure. Given a point $p\in M$, we consider two…
Johnson-Lindenstrauss guarantees certain topological structure is preserved under random projections when project high dimensional deterministic vectors to low dimensional vectors. In this work, we try to understand how random matrix affect…
Squared Wasserstein distance is a frequently used tool to measure discrepancy between probability distributions. This distance is typically computed between empirical measures of size $n$ from two underlying random samples. Unfortunately,…
Recently, a Wasserstein-type distance for Gaussian mixture models has been proposed. However, that framework can only be generalized to identifiable mixtures of general elliptically contoured distributions whose components come from the…
We study the geometric structure of the space of random measures $\mathcal{P}_p(\mathcal{P}_p(X))$, endowed with the Wasserstein on Wasserstein metric, where $(X, d)$ is a complete separable metric space. In this setting, we prove a metric…
Let the random variable $X\, :=\, e(\mathcal{H}[B])$ count the number of edges of a hypergraph $\mathcal{H}$ induced by a random $m$ element subset $B$ of its vertex set. Focussing on the case that $\mathcal{H}$ satisfies some regularity…
We study the contraction in Wasserstein distance of the coordinate ascent variational inference algorithm. This is shown to hold under a transport-information inequality at the fixed points and a functional smoothness condition. The results…
We expound on some known lower bounds of the quadratic Wasserstein distance between random vectors in $\mathbb{R}^n$ with an emphasis on affine transformations that have been used in manifold learning of data in Wasserstein space. In…
Optimal transport (\OT) theory defines a powerful set of tools to compare probability distributions. \OT~suffers however from a few drawbacks, computational and statistical, which have encouraged the proposal of several regularized variants…