Smooth p-Wasserstein Distance: Structure, Empirical Approximation, and Statistical Applications
Abstract
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 Wp(σ), for arbitrary p≥ 1. After establishing basic metric and topological properties of Wp(σ), we explore the asymptotic statistical behavior of Wp(σ)(μn,μ), where μn is the empirical distribution of n independent observations from μ. We prove that Wp(σ) enjoys a parametric empirical convergence rate of n-1/2, which contrasts the n-1/d rate for unsmoothed Wp when d ≥ 3. Our proof relies on controlling Wp(σ) by a pth-order smooth Sobolev distance dp(σ) and deriving the limit distribution of n\,dp(σ)(μn,μ), for all dimensions d. As applications, we provide asymptotic guarantees for two-sample testing and minimum distance estimation using Wp(σ), with experiments for p=2 using a maximum mean discrepancy formulation of d2(σ).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.