Related papers: A canonical barycenter via Wasserstein regularizat…
Impractical assumptions, an inherently myopic nature, and the crucial role of the initial design, all together contribute to making theoretical convergence proofs of little value in real-life Bayesian Optimization applications. In this…
This paper deals with the estimation of a probability measure on the real line from data observed with an additive noise. We are interested in rates of convergence for the Wasserstein metric of order $p\geq 1$. The distribution of the…
Various statistical tasks, including sampling or computing Wasserstein barycenters, can be reformulated as fixed-point problems for operators on probability distributions. Accelerating standard fixed-point iteration schemes provides a…
This paper is concerned with the problem of defining and estimating statistics for distributions on spaces such as Riemannian manifolds and more general metric spaces. The challenge comes, in part, from the fact that statistics such as…
In this paper, we address the classification of instances each characterized not by a singular point, but by a distribution on a vector space. We employ the Wasserstein metric to measure distances between distributions, which are then used…
A probabilistic frame is a Borel probability measure with finite second moment whose support spans $\mathbb{R}^d$. A Parseval probabilistic frame is one for which the associated matrix of the second moments is the identity matrix in…
Optimal transport (OT)-based methods have a wide range of applications and have attracted a tremendous amount of attention in recent years. However, most of the computational approaches of OT do not learn the underlying transport map.…
We prove existence and duality on a wide class of metric spaces, and uniqueness results on any connected, complete Riemannian manifold, with or without boundary, for classical Monge--Kantorovich barycenters. In particular, this is the first…
In this paper we provide conditions for a Wasserstein barycenter to be absolutely continuous with respect to its Hausdorff measure away from the vertices of the graph.
We study the convergence rate of the optimal quantization for a probability measure sequence $(\mu_{n})_{n\in\mathbb{N}^{*}}$ on $\mathbb{R}^{d}$ converging in the Wasserstein distance in two aspects: the first one is the convergence rate…
Dataset Distillation (DD) aims to generate a compact synthetic dataset that enables models to achieve performance comparable to training on the full large dataset, significantly reducing computational costs. Drawing from optimal transport…
We investigate properties of some extensions of a class of Fourier-based probability metrics, originally introduced to study convergence to equilibrium for the solution to the spatially homogeneous Boltzmann equation. At difference with the…
We present a method for computing an approximate Riemannian barycenter of a collection of points lying on a Riemannian manifold. Our approach relies on the use of theoretically proven under- and over-approximations of the Riemannian…
Let $(M^n,g,f)$ be a Ricci shrinker such that $\textrm{Ric}_f=\frac{1}{2}g$ and the measure induced by the weighted volume element $(4\pi)^{-\frac{n}{2}}e^{-f}dv_{g}$ is a probability measure. Given a point $p\in M$, we consider two…
The so-called \emph{simplified} Wasserstein barycenter problem, also known as the cheapest hub problem, consists in selecting one point from each of $k$ given sets, each set consisting of $n$ points, with the aim of minimizing the sum of…
The object of this paper is to study estimates of $\epsilon^{-q}W_p(\mu+\epsilon\nu, \mu)$ for small $\epsilon>0$. Here $W_p$ is the Wasserstein metric on positive measures, $p>1$, $\mu$ is a probability measure and $\nu$ a signed, neutral…
We define barycentric coordinates on a Riemannian manifold using Karcher's center of mass technique applied to point masses for n+1 sufficiently close points, determining an n-dimensional Riemannian simplex defined as a "Karcher simplex."…
Bayesian inference typically requires the computation of an approximation to the posterior distribution. An important requirement for an approximate Bayesian inference algorithm is to output high-accuracy posterior mean and uncertainty…
This paper considers the problem of estimating a matrix that encodes pairwise distances in a finite metric space (or, more generally, the edge weight matrix of a network) under the barycentric coding model (BCM) with respect to the…
We study optimization problems whereby the optimization variable is a probability measure. Since the probability space is not a vector space, many classical and powerful methods for optimization (e.g., gradients) are of little help. Thus,…