Convergence of Gaussian-smoothed optimal transport distance with sub-gamma distributions and dependent samples
Not on the map. Why?
Abstract (arXiv)
The Gaussian-smoothed optimal transport (GOT) framework, recently proposed by Goldfeld et al., scales to high dimensions in estimation and provides an alternative to entropy regularization. This paper provides convergence guarantees for estimating the GOT distance under more general settings. For the Gaussian-smoothed p-Wasserstein distance in d dimensions, our results require only the existence of a moment greater than d + 2p. For the special case of sub-gamma distributions, we quantify the dependence on the dimension d and establish a phase transition with respect to the scale parameter. We also prove convergence for dependent samples, only requiring a condition on the pairwise dependence of the samples measured by the covariance of the feature map of a kernel space. A key step in our analysis is to show that the GOT distance is dominated by a family of kernel maximum mean discrepancy (MMD) distances with a kernel that depends on the cost function as well as the amount of Gaussian smoothing. This insight provides further interpretability for the GOT framework and also introduces a class of kernel MMD distances with desirable properties. The theoretical results are supported by numerical experiments.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 17 of its 55 references that are in the map. First posted on arXiv 28 Feb 2021.
Builds on
17 of 55 references.
References · 17
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2018Computational Optimal Transportcited by 765
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 360
- 2015Generative Moment Matching Networkscited by 252
- 2017MMD GAN: Towards Deeper Understanding of Moment Matching Networkcited by 251
- 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 212
- 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
- 2016Interpretable Distribution Features with Maximum Testing Powercited by 63
- 2018Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distancecited by 56
- 2015Fast Two-Sample Testing with Analytic Representations of Probability Measurescited by 53
- 2018Convergence and Concentration of Empirical Measures under Wasserstein Distance in Unbounded Functional Spacescited by 41
5 more
- 2017Multiscale Strategies for Computing Optimal Transportcited by 18
- 2014FastMMD: Ensemble of Circular Discrepancy for Efficient Two-Sample Testcited by 17
- 2018Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scalingcited by 14
- 2018Greedy stochastic algorithms for entropy-regularized optimal transport problemscited by 9
- 2017Vector and Matrix Optimal Mass Transport: Theory, Algorithm, and Applicationscited by 3
Built on by
Citing papers per year: 2021: 4; 2022: 1; 2023: 0; 2024: 2; 2025: 1.
8 papers.
- 2021Controlling Wasserstein Distances by Kernel Norms with Application to Compressive Statistical Learningcited by 13
- 2024Can Modifying Data Address Graph Domain Adaptation?cited by 9
- 2022Optimal Regularization for a Data Sourcecited by 6
- 2024Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of Phi-Mutual Informationcited by 5
- 2021Order Constraints in Optimal Transportcited by 4
- 2025Differentially Private Wasserstein Barycenterscited by 2
- 2021Limit Distribution Theory for the Smooth 1-Wasserstein Distance with Applicationscited by 1
- 2021Nonparametric mixture MLEs under Gaussian-smoothed optimal transport distancecited by 0
- 2025Differentially Private Wasserstein Barycenters3 Oct 2025
- 2024Can Modifying Data Address Graph Domain Adaptation?27 Jul 2024
- 2024Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of Phi-Mutual Information26 Feb 2024
- 2022Optimal Regularization for a Data Source27 Dec 2022
- 2021Nonparametric mixture MLEs under Gaussian-smoothed optimal transport distance4 Dec 2021
- 2021Controlling Wasserstein Distances by Kernel Norms with Application to Compressive Statistical Learning1 Dec 2021
- 2021Order Constraints in Optimal Transport14 Oct 2021
- 2021Limit Distribution Theory for the Smooth 1-Wasserstein Distance with Applications28 Jul 2021