Related papers: On optimal matching of Gaussian samples III

Let $\mu_p$ be the generalized Gaussian distribution on $\mathbb{R}^n$ with density $e^{-\frac{|x|^p}{p}}$ multiplied by a constant depending on $p\ge 1$ and $n$, and $\alpha_p(n)$ be the largest number such that the Brunn-Minkowski type…

Discrepancy measures between probability distributions, often termed statistical distances, are ubiquitous in probability theory, statistics and machine learning. To combat the curse of dimensionality when estimating these distances from…

We study rates of convergence for estimation of the Gromov-Wasserstein (GW) distance. For two marginals supported on compact subsets of $\R^{d_x}$ and $\R^{d_y}$, respectively, with $\min \{ d_x,d_y \} > 4$, prior work established the rate…

We explore the geometry of the Bures-Wasserstein space for potentially degenerate Gaussian measures on a separable Hilbert space. In this general setting, the optimal transport map is formally the subgradient of a convex function that is…

Consider an empirical measure $\mathbb{P}_n$ induced by $n$ iid samples from a $d$-dimensional $K$-subgaussian distribution $\mathbb{P}$ and let $\gamma = N(0,\sigma^2 I_d)$ be the isotropic Gaussian measure. We study the speed of…

The Wasserstein distance between two probability measures on a metric space is a measure of closeness with applications in statistics, probability, and machine learning. In this work, we consider the fundamental question of how quickly the…

For $\ell\colon \mathbb{R}^d \to [0,\infty)$ we consider the sequence of probability measures $\left(\mu_n\right)_{n \in \mathbb{N}}$, where $\mu_n$ is determined by a density that is proportional to $\exp(-n\ell)$. We allow for infinitely…

A common way to discretize a probability measure is to use an empirical measure as a discrete approximation. But how far from being optimal is this approximation in the p-Wasserstein distance? In this paper, we study this question in two…

Let $\gamma$ be the standard Gaussian measure on $\mathbb{R}^n$ and let $\mathcal{P}_{\gamma}$ be the space of probability measures that are absolutely continuous with respect to $\gamma$. We study lower bounds for the functional…

This paper concerns the approximation of probability measures on $\mathbf{R}^d$ with respect to the Kullback-Leibler divergence. Given an admissible target measure, we show the existence of the best approximation, with respect to this…

Given $d\ge 1$, we provide a construction of the random measure - the critical Gaussian Multiplicative Chaos - formally defined $e^{\sqrt{2d}X}\mathrm{d} \mu$ where $X$ is a $\log$-correlated Gaussian field and $\mu$ is a locally finite…

Let $X:=(X_t)_{t\geq 0}$ be an ergodic Markov process on $\real^d$, and $p>0$. We derive upper bounds of the $p$-Wasserstein distance between the invariant measure and the empirical measures of the Markov process $X$. For this we assume,…

We obtain new bounds for the optimal matching cost for empirical measures with unbounded support. For a large class of radially symmetric and rapidly decaying probability laws, we prove for the first time the asymptotic rate of convergence…

We consider random i.i.d. samples of absolutely continuous measures on bounded connected domains. We prove an upper bound on the $\infty$-transportation distance between the measure and the empirical measure of the sample. The bound is…

Given $n$ independent random marked $d$-vectors $X_i$ with a common density, define the measure $\nu_n = \sum_i \xi_i $, where $\xi_i$ is a measure (not necessarily a point measure) determined by the (suitably rescaled) set of points near…

Consider the empirical measure, $\hat{\mathbb{P}}_N$, associated to $N$ i.i.d. samples of a given probability distribution $\mathbb{P}$ on the unit interval. For fixed $\mathbb{P}$ the Wasserstein distance between $\hat{\mathbb{P}}_N$ and…

For a stationary random function $\xi$, sampled on a subset $D$ of $\mathbb{R}^{d}$, we examine the equivalence and orthogonality of two zero-mean Gaussian measures $\mathbb{P}_{1}$ and $\mathbb{P}_{2}$ associated with $\xi$. We give the…

The study of finite approximations of probability measures has a long history. In (Xu and Berger, 2017), the authors focus on constrained finite approximations and, in particular, uniform ones in dimension $d=1$. The present paper gives an…

We show that in any complete metric space the probability measures $\mu$ with compact and connected support are the ones having the property that the optimal tranportation distance to any other probability measure $\nu$ living on the…

A popular approach to solving large probabilistic systems relies on aggregating states based on a measure of similarity. Many approaches in the literature are heuristic. A number of recent methods rely instead on metrics based on the notion…