Skip to yearly menu bar Skip to main content


Spotlight

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

Sloan Nietert · Ziv Goldfeld · Kengo Kato

[ ] [ Visit Algorithms 5 ] [ Paper ]
[ Paper ]

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 pp-Wasserstein distance W(σ)p, for arbitrary p1. After establishing basic metric and topological properties of W(σ)p, we explore the asymptotic statistical properties 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 n1/2, which contrasts the n1/d rate for unsmoothed \Wp when d3. Our proof relies on controlling W(σ)p by a pth-order smooth Sobolev distance d(σ)p and deriving the limit distribution of nd(σ)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.

Chat is not available.