相关论文: Kantorovich-Rubinstein distance and barycenter for…
We analyze statistical properties of plug-in estimators for unbalanced optimal transport quantities between finitely supported measures in different prototypical sampling models. Specifically, our main results provide non-asymptotic bounds…
Computational implementation of optimal transport barycenters for a set of target probability measures requires a form of approximation, a widespread solution being empirical approximation of measures. We provide an $O(\sqrt{N/n})$…
Optimal transport (OT) barycenters are a mathematically grounded way of averaging probability distributions while capturing their geometric properties. In short, the barycenter task is to take the average of a collection of probability…
The Hellinger-Kantorovich (HK) distance is an unbalanced extension of the Wasserstein-2 distance. It was shown recently that the HK barycenter exhibits a much more complex behaviour than the Wasserstein barycenter. Motivated by this…
We show that the problem of finding the barycenter in the Hellinger-Kantorovich setting admits a least-cost soft multi-marginal formulation, provided that a one-sided hard marginal constraint is introduced. The constrained approach is then…
We introduce and study a variant of the Wasserstein distance on the space of probability measures, specially designed to deal with measures whose support has a dendritic, or treelike structure with a particular direction of orientation. Our…
We study the barycenter of the Hellinger--Kantorovich metric over non-negative measures on compact, convex subsets of $\mathbb{R}^d$. The article establishes existence, uniqueness (under suitable assumptions) and equivalence between a…
Wasserstein barycentres represent average distributions between multiple probability measures for the Wasserstein distance. The numerical computation of Wasserstein barycentres is notoriously challenging. A common approach is to use…
We introduce the transport-transform (TT) and the relative transport-transform (RTT) metrics between finite point patterns on a general space, which provide a unified framework for earlier point pattern metrics, in particular the…
Wasserstein Barycenter is a principled approach to represent the weighted mean of a given set of probability distributions, utilizing the geometry induced by optimal transport. In this work, we present a novel scalable algorithm to…
This article presents a new class of distances between arbitrary nonnegative Radon measures inspired by optimal transport. These distances are defined by two equivalent alternative formulations: (i) a dynamic formulation defining the…
We study two topologies $\tau_{KR}$ and $\tau_K$ on the space of measures on a completely regular space generated by Kantorovich--Rubinshtein and Kantorovich seminorms analogous to their classical norms in the case of a metric space. The…
Barycenter problems encode important geometric information about a metric space. While these problems are typically studied with positive weight coefficients associated to each distance term, more general signed Wasserstein barycenter…
We study a general formulation of regularized Wasserstein barycenters that enjoys favorable regularity, approximation, stability and (grid-free) optimization properties. This barycenter is defined as the unique probability measure that…
In this paper, we establish a Kantorovich duality for weak optimal total variation transport problems. As consequences, we recover a version of duality formula for partial optimal transports established by Caffarelli and McCann; and we also…
Computationally solving multi-marginal optimal transport (MOT) with squared Euclidean costs for $N$ discrete probability measures has recently attracted considerable attention, in part because of the correspondence of its solutions with…
Due to its invariance to rigid transformations such as rotations and reflections, Procrustes-Wasserstein (PW) was introduced in the literature as an optimal transport (OT) distance, alternative to Wasserstein and more suited to tasks such…
We present new algorithms to compute the mean of a set of empirical probability measures under the optimal transport metric. This mean, known as the Wasserstein barycenter, is the measure that minimizes the sum of its Wasserstein distances…
Given a collection of probability measures, a practitioner sometimes needs to find an "average" distribution which adequately aggregates reference distributions. A theoretically appealing notion of such an average is the Wasserstein…
We explore a robust version of the barycenter problem among $n$ centered Gaussian probability measures, termed Semi-Unbalanced Optimal Transport (SUOT)-based Barycenter, wherein the barycenter remains fixed while the others are relaxed…