Convergence and finite sample approximations of entropic regularized Wasserstein distances in Gaussian and RKHS settings
Not on the map. Why?
Abstract (arXiv)
This work studies the convergence and finite sample approximations of entropic regularized Wasserstein distances in the Hilbert space setting. Our first main result is that for Gaussian measures on an infinite-dimensional Hilbert space, convergence in the 2-Sinkhorn divergence is it strictly weaker than convergence in the exact 2-Wasserstein distance. Specifically, a sequence of centered Gaussian measures converges in the 2-Sinkhorn divergence if the corresponding covariance operators converge in the Hilbert-Schmidt norm. This is in contrast to the previous known result that a sequence of centered Gaussian measures converges in the exact 2-Wasserstein distance if and only if the covariance operators converge in the trace class norm. In the reproducing kernel Hilbert space (RKHS) setting, the it kernel Gaussian-Sinkhorn divergence, which is the Sinkhorn divergence between Gaussian measures defined on an RKHS, defines a semi-metric on the set of Borel probability measures on a Polish space, given a characteristic kernel on that space. With the Hilbert-Schmidt norm convergence, we obtain it dimension-independent convergence rates for finite sample approximations of the kernel Gaussian-Sinkhorn divergence, with the same order as the Maximum Mean Discrepancy. These convergence rates apply in particular to Sinkhorn divergence between Gaussian measures on Euclidean and infinite-dimensional Hilbert spaces. The sample complexity for the 2-Wasserstein distance between Gaussian measures on Euclidean space, while dimension-dependent and larger than that of the Sinkhorn divergence, is exponentially faster than the worst case scenario in the literature.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 13 of its 56 references that are in the map. First posted on arXiv 5 Jan 2021.
Builds on
13 of 56 references.
References · 13
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2018Computational Optimal Transportcited by 765
- 2017Learning Generative Models with Sinkhorn Divergencescited by 310
- 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
- 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
- 2015On Wasserstein Two Sample Testing and Related Families of Nonparametric Testscited by 165
- 2018Adversarial Regularizers in Inverse Problemscited by 102
- 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
- 2020Entropy-Regularized 2-Wasserstein Distance between Gaussian Measurescited by 32
- 2018Procrustes Metrics on Covariance Operators and Optimal Transportation of Gaussian Processescited by 19
- 2019How Well Do WGANs Estimate the Wasserstein Metric?cited by 15
- 2020The statistical effect of entropic regularization in optimal transportationcited by 14
Built on by
Citing papers per year: 2021: 2; 2022: 1.
3 papers.
- 2022Kullback-Leibler and Renyi divergences in reproducing kernel Hilbert space and Gaussian process settingscited by 4
- 2021Estimation of Riemannian distances between covariance operators and Gaussian processescited by 3
- 2021Finite sample approximations of exact and entropic Wasserstein distances between covariance operators and Gaussian processescited by 0
- 2022Kullback-Leibler and Renyi divergences in reproducing kernel Hilbert space and Gaussian process settings18 Jul 2022
- 2021Estimation of Riemannian distances between covariance operators and Gaussian processes26 Aug 2021
- 2021Finite sample approximations of exact and entropic Wasserstein distances between covariance operators and Gaussian processes26 Apr 2021