Gaussian-Smoothed Sliced Probability Divergences
Not on the map. Why?
Abstract (arXiv)
Gaussian smoothed sliced Wasserstein distance has been recently introduced for comparing probability distributions, while preserving privacy on the data. It has been shown that it provides performances similar to its non-smoothed (non-private) counterpart. However, the computationaland statistical properties of such a metric have not yet been well-established. This work investigates the theoretical properties of this distance as well as those of generalized versions denoted as Gaussian-smoothed sliced divergences. We first show that smoothing and slicing preserve the metric property and the weak topology. To study the sample complexity of such divergences, we then introduce hathatμn the double empirical distribution for the smoothed-projected μ. The distribution hathatμn is a result of a double sampling process: one from sampling according to the origin distribution μ and the second according to the convolution of the projection of μ on the unit sphere and the Gaussian smoothing. We particularly focus on the Gaussian smoothed sliced Wasserstein distance and prove that it converges with a rate O(n-1/2). We also derive other properties, including continuity, of different divergences with respect to the smoothing parameter. We support our theoretical findings with empirical studies in the context of privacy-preserving domain adaptation.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 40 references that are in the map. First posted on arXiv 4 Apr 2024.
Builds on
20 of 40 references.
References · 20
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,906
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
- 2018Computational Optimal Transportcited by 765
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2017Learning Generative Models with Sinkhorn Divergencescited by 310
- 2019Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptationcited by 235
- 2019Generalized Sliced Wasserstein Distancescited by 205
- 2018Improving GANs Using Optimal Transportcited by 122
- 2019Max-Sliced Wasserstein Distance and its use for GANscited by 118
- 2016Generative Models and Model Criticism via Optimized Maximum Mean Discrepancycited by 99
- 2020Statistical and Topological Properties of Sliced Probability Divergencescited by 83
- 2020Distributional Sliced-Wasserstein and Applications to Generative Modelingcited by 69
8 more
- 2015Sliced Wasserstein Kernels for Probability Distributionscited by 64
- 2019Sliced Wasserstein Generative Modelscited by 61
- 2020On Projection Robust Optimal Transport: Sample Complexity and Model Misspecificationcited by 34
- 2022Hierarchical Sliced Wasserstein Distancecited by 23
- 2021Differentially Private Sliced Wasserstein Distancecited by 19
- 2021Smooth p-Wasserstein Distance: Structure, Empirical Approximation, and Statistical Applicationscited by 15
- 2023Markovian Sliced Wasserstein Distances: Beyond Independent Projectionscited by 11
- 2023Self-Attention Amortized Distributional Projection Optimization for Sliced Wasserstein Point-Cloud Reconstructioncited by 7
Built on by
Not cited yet.