Smooth p-Wasserstein Distance: Structure, Empirical Approximation, and Statistical Applications

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 data, recent work has proposed smoothing out local irregularities in the measured distributions via convolution with a Gaussian kernel. Motivated by the scalability of this framework to high dimensions, we investigate the structural and statistical behavior of the Gaussian-smoothed p-Wasserstein distance W (σ) p , for arbitrary p ≥ 1. After establishing basic metric and topological properties of W (σ) p , we explore the asymptotic statistical behavior of W (σ) p (μ n , µ), where μn is the empirical distribution of n independent observations from µ. We prove that W (σ) p enjoys a parametric empirical convergence rate of n -1/2 , which contrasts the n -1/d rate for unsmoothed W p when d ≥ 3. Our proof relies on controlling W (σ) p by a pth-order smooth Sobolev distance d (σ) p and deriving the limit distribution of √ n d (σ) p (μ n , µ), for all dimensions d. As applications, we provide asymptotic guarantees for two-sample testing and minimum distance estimation using W (σ) p , with experiments for p = 2 using a maximum mean discrepancy formulation of d (σ) 2 .