Related papers: Triangle Inequality for a Quantum Wasserstein Dive…
We establish transportation cost inequalities (TCI) with respect to the quantum Wasserstein distance by introducing quantum extensions of well-known classical methods: first, using a non-commutative version of Ollivier's coarse Ricci…
The goal of the present paper is to discuss new transport inequalities for convex measures. We retrieve some dimensional forms of Brascamp-Lieb inequalities. We also give some quantitative forms involving the Wasserstein's distances.
We show how one can obtain a class of quadratic Wasserstein metrics, that is to say, Wasserstein metrics of order 2, on the set of faithful normal states of a von Neumann algebra $A$, via transport plans, rather than through a dynamical…
We introduce a novel optimal transport framework for probabilistic circuits (PCs). While it has been shown recently that divergences between distributions represented as certain classes of PCs can be computed tractably, to the best of our…
We show that the quantum generalization of the $2$-Wasserstein distance proposed by Chakrabarti et al. is not monotone under partial traces. This disproves a recent conjecture by Friedland et al. Finally, we propose a stabilized version of…
In this paper, we prove that the time supremum of the Wasserstein distance between the time-marginals of a uniformly elliptic multidimensional diffusion with coefficients bounded together with their derivatives up to the order $2$ in the…
Optimal transport provides a powerful mathematical framework with applications spanning numerous fields. A cornerstone within this domain is the $p$-Wasserstein distance, which serves to quantify the cost of transporting one probability…
Optimal transport (OT) provides powerful tools for comparing probability measures in various types. The Wasserstein distance which arises naturally from the idea of OT is widely used in many machine learning applications. Unfortunately,…
Wasserstein distance is a key metric for quantifying data divergence from a distributional perspective. However, its application in privacy-sensitive environments, where direct sharing of raw data is prohibited, presents significant…
This paper deals with the famous isoperimetric inequality. In a first part, we give some new functional form of the isoperimetric inequality, and in a second part, we give a quantitative form with a remainder term involving Wasserstein…
Wasserstein distances are widely used in modern data analysis but pose significant computational and statistical challenges in high dimensions. The sliced Wasserstein distance alleviates these challenges by leveraging one-dimensional…
We prove a refined contraction inequality for diffusion semigroups with respect to the Wasserstein distance on a compact Riemannian manifold taking account of the dimension. The result generalizes in a Riemannian context, the dimensional…
An analogue of the quadratic Wasserstein (or Monge-Kantorovich) distance between Borel probability measures on $\mathbf{R}^d$ has been defined in [F. Golse, C. Mouhot, T. Paul: Commun. Math. Phys. 343 (2015), 165-205] for density operators…
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…
We discuss the relation between the Wasserstein distance of order 1 between probability distributions on a metric space, arising in the study of Monge-Kantorovich transport problem, and the spectral distance of noncommutative geometry.…
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 study a quantum analogue of the 2-Wasserstein distance as a measure of proximity on the set $\Omega_N$ of density matrices of dimension $N$. We show that such (semi-)distances do not induce Riemannian metrics on the tangent bundle of…
In this short note the authors give answers to the three open problems formulated by Wu and Srivastava [{\it Appl. Math. Lett. 25 (2012), 1347--1353}]. We disprove the Problem 1, by showing that there exists a triangle which does not…
Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in…
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…