mlsanityData to 7 Oct 2026

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

arXiv 2101.04039 ↗First posted 11 Jan 2021math.ST stat.ML stat.THcited by 15

Not on the map. Why?

Abstract (arXiv)

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 mathsfWp(σ), for arbitrary p≥ 1. After establishing basic metric and topological properties of mathsfWp(σ), we explore the asymptotic statistical behavior of mathsfWp(σ)(hatμn,μ), where hatμn is the empirical distribution of n independent observations from μ. We prove that mathsfWp(σ) enjoys a parametric empirical convergence rate of n-1/2, which contrasts the n-1/d rate for unsmoothed mathsfWp when d ≥ 3. Our proof relies on controlling mathsfWp(σ) by a pth-order smooth Sobolev distance mathsfdp(σ) and deriving the limit distribution of √n,mathsfdp(σ)(hatμn,μ), for all dimensions d. As applications, we provide asymptotic guarantees for two-sample testing and minimum distance estimation using mathsfWp(σ), with experiments for p=2 using a maximum mean discrepancy formulation of mathsfd2(σ).

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 21 of its 73 references that are in the map. First posted on arXiv 11 Jan 2021.

Builds on

21 of 73 references.

References · 21

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2017Improved Training of Wasserstein GANscited by 2,223
  3. 2015Optimal Transport for Domain Adaptationcited by 457
  4. 2017Wasserstein Auto-Encoderscited by 371
  5. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  6. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  7. 2018Statistical Aspects of Wasserstein Distancescited by 202
  8. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
  9. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
  10. 2015On Wasserstein Two Sample Testing and Related Families of Nonparametric Testscited by 165
  11. 2017Generalization and Equilibrium in Generative Adversarial Nets (GANs)cited by 165
  12. 2019Max-Sliced Wasserstein Distance and its use for GANscited by 118
9 more
  1. 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
  2. 2020Statistical and Topological Properties of Sliced Probability Divergencescited by 83
  3. 2017On the Discrimination-Generalization Tradeoff in GANscited by 48
  4. 2019Asymptotic Guarantees for Learning Generative Models with the Sliced-Wasserstein Distancecited by 43
  5. 2018Convergence and Concentration of Empirical Measures under Wasserstein Distance in Unbounded Functional Spacescited by 41
  6. 2018Optimal Transport Based Distributionally Robust Optimization: Structural Properties and Iterative Schemescited by 30
  7. 2016Inference for Empirical Wasserstein Distances on Finite Spacescited by 21
  8. 2016Pufferfish Privacy Mechanisms for Correlated Datacited by 16
  9. 2020Multivariate goodness-of-Fit tests based on Wasserstein distancecited by 11

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 1; 2023: 1; 2024: 4; 2025: 6.

15 papers.

Sort:

By area: