Related papers: Transport alpha divergences
Let $f: [0,1]^d \rightarrow \mathbb{R}$ be a continuous function with zero mean and interpret $f_{+} = \max(f, 0)$ and $f_{-} = -\min(f, 0)$ as the densities of two measures. We prove that if the cost of transport from $f_{+}$ to $f_{-}$ is…
The Wasserstein distance, rooted in optimal transport (OT) theory, is a popular discrepancy measure between probability distributions with various applications to statistics and machine learning. Despite their rich structure and…
Correctly estimating the discrepancy between two data distributions has always been an important task in Machine Learning. Recently, Cuturi proposed the Sinkhorn distance which makes use of an approximate Optimal Transport cost between two…
Particle-based variational inference offers a flexible way of approximating complex posterior distributions with a set of particles. In this paper we introduce a new particle-based variational inference method based on the theory of…
Distribution data refers to a data set where each sample is represented as a probability distribution, a subject area receiving burgeoning interest in the field of statistics. Although several studies have developed…
We study the problem of quantifying how far an empirical distribution deviates from Gaussianity under the framework of optimal transport. By exploiting the cone geometry of the relative translation invariant quadratic Wasserstein space, we…
This work studies the convergence and finite sample approximations of entropic regularized Wasserstein distances in the Hilbert space setting. Our first main result is that for Gaussian measures on an infinite-dimensional Hilbert space,…
A recurring obstacle in the study of Wasserstein gradient flow is the lack of convexity of the square Wasserstein metric. In this paper, we develop a class of transport metrics that have better convexity properties and use these metrics to…
We develop a projected Wasserstein distance for the two-sample test, a fundamental problem in statistics and machine learning: given two sets of samples, to determine whether they are from the same distribution. In particular, we aim to…
Optimal transport distances, otherwise known as Wasserstein distances, have recently drawn ample attention in computer vision and machine learning as a powerful discrepancy measure for probability distributions. The recent developments on…
We propose new nonparametric accordance R\'enyi-$\alpha$ and $\alpha$-Tsallis divergence estimators for continuous distributions. We discuss this approach with a view to the selection model (on al\'etoire and autoregressive AR (1)). We…
We present a new lower bound on the differential entropy rate of stationary processes whose sequences of probability density functions fulfill certain regularity conditions. This bound is obtained by showing that the gap between the…
We relate transport-entropy inequalities to the study of critical points of functionals defined on the space of probability measures. This approach leads in particular to a new proof of a result by Otto and Villani [43] showing that the…
We study Benamou's domain decomposition algorithm for optimal transport in the entropy regularized setting. The key observation is that the regularized variant converges to the globally optimal solution under very mild assumptions. We prove…
In this article, we generalize the Wasserstein distance to measures with different masses. We study the properties of such distance. In particular, we show that it metrizes weak convergence for tight sequences. We use this generalized…
In this paper we consider a random walk of a particle in $\mathbb{R}^d$. Convergence of different transformations of trajectories of random flights with Poisson switching moments has been obtained by Davydov and Konakov, as well as…
We study the problem of non-asymptotic deviations between a reference measure and its empirical version, in the 1-Wasserstein metric, under the standing assumption that the measure satisfies a transport-entropy inequality. We extend some…
We introduce the proximal optimal transport divergence, a novel discrepancy measure that interpolates between information divergences and optimal transport distances via an infimal convolution formulation. This divergence provides a…
We consider an optimal transport problem on the unit simplex whose solutions are given by gradients of exponentially concave functions and prove two main results. First, we show that the optimal transport is the large deviation limit of a…
We prove a pointwise $C^{2,\,\alpha}$ estimate for the potential of the optimal transport map in the case that the densities are only close to constant in a certain $L^p$ sense.