Asymptotics of smoothed Wasserstein distances in the small noise regime
Yunzi Ding, Jonathan Niles-Weed
Abstract
We study the behavior of the Wasserstein- distance between discrete measures and in when both measures are smoothed by small amounts of Gaussian noise. This procedure, known as Gaussian-smoothed optimal transport, has recently attracted attention as a statistically attractive alternative to the unregularized Wasserstein distance. We give precise bounds on the approximation properties of this proposal in the small noise regime, and establish the existence of a phase transition: we show that, if the optimal transport plan from to is unique and a perfect matching, there exists a critical threshold such that the difference between and the Gaussian-smoothed OT distance scales like for below the threshold, and scales like above it. These results establish that for sufficiently small, the smoothed Wasserstein distance approximates the unregularized distance exponentially well.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 53b7579e-08d2-4f8b-9ccb-4d83ca1bf03aCited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- Quantifying the noise sensitivity of the Wasserstein metric for imagesErik Lager, Gilles Mordant, Amit MoscovichICML 2026
- A Combinatorial Algorithm for the Semi-Discrete Optimal Transport ProblemPankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan YaoNeurIPS 2024 · 4 citations
- Smooth p-Wasserstein Distance: Structure, Empirical Approximation, and Statistical ApplicationsSloan Nietert, Ziv Goldfeld, Kengo KatoICML 2021 · 39 citations
- Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric ProjectionsNabarun Deb, Promit Ghosal, Bodhisattva SenNeurIPS 2021 · 96 citations
- Scalable Approximation Algorithms for p-Wasserstein Distance and Its VariantsNathaniel Lahn, Sharath Raghvendra, Emma Saarinen, Pouyan ShirzadianICML 2025
