Related papers: On the Bures-Wasserstein distance between positive…
In this paper, a regularization of Wasserstein barycenters for random measures supported on $\mathbb{R}^{d}$ is introduced via convex penalization. The existence and uniqueness of such barycenters is first proved for a large class of…
We derive explicitly the adapted $2$-Wasserstein distance between non-degenerate Gaussian distributions on $\mathbb{R}^N$ and characterize the optimal bicausal coupling(s). This leads to an adapted version of the Bures-Wasserstein distance…
A common feature of methods for analyzing samples of probability density functions is that they respect the geometry inherent to the space of densities. Once a metric is specified for this space, the Fr\'echet mean is typically used to…
We are interested in the following two $\mathbb{R}^d$-valued stochastic differential equations (SDEs): \begin{gather*} d X_t=b(X_t)\,d t + \sigma\,d L_t, \quad X_0=x, %\label{BM-SDE} d Y_t=b(Y_t)\,d t + \sigma\,d B_t, \quad Y_0=y,…
Computing the unregularized Wasserstein barycenter for measure-valued data is a challenging optimization task. Recent algorithms have been tailored to either discrete measures as point clouds or continuous measures discretized on regular…
In this article, we study Wasserstein-type metrics and corresponding barycenters for mixtures of a chosen subset of probability measures called atoms hereafter. In particular, this works extends what was proposed by Delon and Desolneux [A…
We introduce dynamic and static formulations that formally extend unbalanced optimal transport from the space of positive densities to the space of Riemannian metrics. The first construction is based on a dynamic variational formulation in…
The set of covariance matrices equipped with the Bures-Wasserstein distance is the orbit space of the smooth, proper and isometric action of the orthogonal group on the Euclidean space of square matrices. This construction induces a natural…
We study a Riemannian metric on the cone of symmetric positive-definite matrices obtained from the Hessian of the power potential function $(1-\det(X)^\beta)/\beta$. We give explicit expressions for the geodesics and distance function,…
Wasserstein barycenter, built on the theory of optimal transport, provides a powerful framework to aggregate probability distributions, and it has increasingly attracted great attention within the machine learning community. However, it…
A generalization of the Wasserstein metric, the integrated transportation distance, establishes a novel distance between probability kernels of Markov systems. This metric serves as the foundation for an efficient approximation technique,…
The Wasserstein metric or earth mover's distance (EMD) is a useful tool in statistics, machine learning and computer science with many applications to biological or medical imaging, among others. Especially in the light of increasingly…
Wasserstein barycenters provide a geometric notion of the weighted average of probability measures based on optimal transport. In this paper, we present a scalable algorithm to compute Wasserstein-2 barycenters given sample access to the…
Bures distance holds a special place among various distance measures due to its several distinguished features and finds applications in diverse problems in quantum information theory. It is related to fidelity and, among other things, it…
Let $\mu$ be a doubling measure in $\mathbb{R}^n$. We investigate quantitative relations between the rectifiability of $\mu$ and its distance to flat measures. More precisely, for $x$ in the support $\Sigma$ of $\mu$ and $r > 0$, we…
In this paper, we focus on the analysis of the regularized Wasserstein barycenter problem. We provide uniqueness and a characterization of the barycenter for two important classes of probability measures: (i) Gaussian distributions and (ii)…
We study the Wasserstein (or earthmover) metric on the space $P(X)$ of probability measures on a metric space $X$. We show that, if a finite metric space $X$ embeds stochastically with distortion $D$ in a family of finite metric trees, then…
Multi-marginal optimal transport enables one to compare multiple probability measures, which increasingly finds application in multi-task learning problems. One practical limitation of multi-marginal transport is computational scalability…
As interest in graph data has grown in recent years, the computation of various geometric tools has become essential. In some area such as mesh processing, they often rely on the computation of geodesics and shortest paths in discretized…
We define geometric matrix midranges for positive definite Hermitian matrices and study the midrange problem from a number of perspectives. Special attention is given to the midrange of two positive definite matrices before considering the…