Related papers: Entropic-Wasserstein barycenters: PDE characteriza…
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…
We study in this paper a variant of Wasserstein barycenter problem, which we refer to as tree-Wasserstein barycenter, by leveraging a specific class of ground metrics, namely tree metrics, for Wasserstein distance. Drawing on the tree…
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…
Barcodes form a complete set of invariants for interval decomposable persistence modules and are an important summary in topological data analysis. The set of barcodes is equipped with a canonical one-parameter family of metrics, the…
The article presents new entropic continuity bounds for conditional expectations and conditional covariance matrices. These bounds are expressed in terms of the relative entropy between different coupling distributions. Our approach…
Barycentric averaging is a principled way of summarizing populations of measures. Existing algorithms for estimating barycenters typically parametrize them as weighted sums of Diracs and optimize their weights and/or locations. However,…
We introduce weak barycenters of a family of probability distributions, based on the recently developed notion of optimal weak transport of mass by Gozlanet al. (2017) and Backhoff-Veraguas et al. (2020). We provide a theoretical analysis…
A rigorous connection is established between the local porosity entropy introduced by Boger et al. (Physica A 187, 55 (1992)) and the configurational entropy of Andraud et al. (Physica A 207, 208 (1994)). These entropies were introduced as…
This paper is focused on the statistical analysis of probability measures $\nu_{1},\ldots,\nu_{n}$ on $\mathbb{R}$ that can be viewed as independent realizations of an underlying stochastic process. We consider the situation of practical…
This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [106] and introduce a new metric, called the Wasserstein distance…
We propose the linear barycentric coding model (LBCM) which utilizes the linear optimal transport (LOT) metric for analysis and synthesis of probability measures. We provide a closed-form solution to the variational problem characterizing…
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…
A new least squares mean of positive definite matrices for the divergence associated with the sandwiched quasi-relative entropy has been introduced. It generalizes the well-known Wasserstein mean for covariance matrices of Gaussian…
We first develop a theory of conditional expectations for random variables with values in a complete metric space $M$ equipped with a contractive barycentric map $\beta$, and then give convergence theorems for martingales of…
In this paper we propose to perform model ensembling in a multiclass or a multilabel learning setting using Wasserstein (W.) barycenters. Optimal transport metrics, such as the Wasserstein distance, allow incorporating semantic side…
The aim of this paper is to establish rates of convergence to Gaussianity for wavelet coefficients on circular Poisson random fields. This result is established by using the Stein-Malliavin techniques introduced by Peccati and Zheng (2011)…
Collecting and aggregating information from several probability measures or histograms is a fundamental task in machine learning. One of the popular solution methods for this task is to compute the barycenter of the probability measures…
This work presents several expected generalization error bounds based on the Wasserstein distance. More specifically, it introduces full-dataset, single-letter, and random-subset bounds, and their analogues in the randomized subsample…
The geometric tangent cone to a probability measure $\mu$ is a set of measure-valued applications that are almost geodesics. This is a nonlocal condition, typically lost when conditioning the measure on a given set. We show that if one…
In a pair of recent articles [PRL 105 (2010) 041302 - arXiv:1005.1132; JHEP 1103 (2011) 056 - arXiv:1012.2867] two of the current authors have developed an entropy bound for equilibrium uncollapsed matter using only classical general…