Table of Contents
Fetching ...

Rate of convergence of the smoothed empirical Wasserstein distance

Adam Block, Zeyu Jia, Yury Polyanskiy, Alexander Rakhlin

TL;DR

This paper analyzes the convergence rates of the Gaussian-smoothed empirical Wasserstein distance between the empirical measure $\mathbb{P}_n$ and a true $K$-subgaussian distribution $\mathbb{P}$ after convolution with $\mathcal{N}(0,\sigma^2 I_d)$. It establishes a sharp threshold at $K=\sigma$ separating a parametric $n^{-1/2}$ rate (for $K<\sigma$) from non-parametric rates (in particular, a precise $\alpha$ in 1D when $K>\sigma$). The authors also derive $D_{KL}$ convergence rates, showing $O((\log n)^d/n)$ for all $K$, with a slower polylog penalty when $K>\sigma$, and they connect these findings to failures of $T_2$ transportation and LSI in Gaussian-mixture settings, resolving open problems in the literature. Methodologically, they leverage a χ^2 mutual information framework and Rényi divergences to link information-theoretic quantities to Wasserstein and KL rates, producing both upper and lower bounds that pin down the phase transition and rate constants.

Abstract

Consider an empirical measure $\mathbb{P}_n$ induced by $n$ iid samples from a $d$-dimensional $K$-subgaussian distribution $\mathbb{P}$ and let $γ= N(0,σ^2 I_d)$ be the isotropic Gaussian measure. We study the speed of convergence of the smoothed Wasserstein distance $W_2(\mathbb{P}_n * γ, \mathbb{P}*γ) = n^{-α+ o(1)}$ with $*$ being the convolution of measures. For $K<σ$ and in any dimension $d\ge 1$ we show that $α= {1\over2}$. For $K>σ$ in dimension $d=1$ we show that the rate is slower and is given by $α= {(σ^2 + K^2)^2\over 4 (σ^4 + K^4)} < 1/2$. This resolves several open problems in [GGNWP20], and in particular precisely identifies the amount of smoothing $σ$ needed to obtain a parametric rate. In addition, for any $d$-dimensional $K$-subgaussian distribution $\mathbb{P}$, we also establish that $D_{KL}(\mathbb{P}_n * γ\|\mathbb{P}*γ)$ has rate $O(1/n)$ for $K<σ$ but only slows down to $O({(\log n)^{d+1}\over n})$ for $K>σ$. The surprising difference of the behavior of $W_2^2$ and KL implies the failure of $T_{2}$-transportation inequality when $σ< K$. Consequently, it follows that for $K>σ$ the log-Sobolev inequality (LSI) for the Gaussian mixture $\mathbb{P} * N(0, σ^{2})$ cannot hold. This closes an open problem in [WW+16], who established the LSI under the condition $K<σ$ and asked if their bound can be improved.

Rate of convergence of the smoothed empirical Wasserstein distance

TL;DR

This paper analyzes the convergence rates of the Gaussian-smoothed empirical Wasserstein distance between the empirical measure and a true -subgaussian distribution after convolution with . It establishes a sharp threshold at separating a parametric rate (for ) from non-parametric rates (in particular, a precise in 1D when ). The authors also derive convergence rates, showing for all , with a slower polylog penalty when , and they connect these findings to failures of transportation and LSI in Gaussian-mixture settings, resolving open problems in the literature. Methodologically, they leverage a χ^2 mutual information framework and Rényi divergences to link information-theoretic quantities to Wasserstein and KL rates, producing both upper and lower bounds that pin down the phase transition and rate constants.

Abstract

Consider an empirical measure induced by iid samples from a -dimensional -subgaussian distribution and let be the isotropic Gaussian measure. We study the speed of convergence of the smoothed Wasserstein distance with being the convolution of measures. For and in any dimension we show that . For in dimension we show that the rate is slower and is given by . This resolves several open problems in [GGNWP20], and in particular precisely identifies the amount of smoothing needed to obtain a parametric rate. In addition, for any -dimensional -subgaussian distribution , we also establish that has rate for but only slows down to for . The surprising difference of the behavior of and KL implies the failure of -transportation inequality when . Consequently, it follows that for the log-Sobolev inequality (LSI) for the Gaussian mixture cannot hold. This closes an open problem in [WW+16], who established the LSI under the condition and asked if their bound can be improved.
Paper Structure (17 sections, 21 theorems, 225 equations)

This paper contains 17 sections, 21 theorems, 225 equations.

Key Result

Corollary 1

For any $K>\sigma$ there exists a $K$-subgaussian $\mathbb{P}$ on $\mathbb{R}^1$ such that $\mathbb{P}*\mathcal{N}(0, \sigma^{2})$ does not satisfy $T_2$-transportation inequality (and hence does not satisfy the LSI either), that is $T_2(\mathbb{P}*\mathcal{N}(0, \sigma^{2}))=\infty$.

Theorems & Definitions (49)

  • Corollary 1
  • Theorem 1
  • proof : Proof Idea.
  • Proposition 1
  • Proposition 2
  • Theorem 2
  • Remark 1
  • Remark 2
  • Theorem 3
  • Remark 3
  • ...and 39 more