mlsanityData to 14 Oct 2026

Statistical and Topological Properties of Gaussian Smoothed Sliced Probability Divergences

arXiv 2110.10524 ↗First posted 20 Oct 2021cs.LG cs.AI cs.CRcited by 7

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, in applications such as domain adaptation, to provide performances similar to its non-private (non-smoothed) counterpart. However, the computational and statistical properties of such a metric is not yet been well-established. In this paper, we analyze the theoretical properties of this distance as well as those of generalized versions denoted as Gaussian smoothed sliced divergences. We show that smoothing and slicing preserve the metric property and the weak topology. We also provide results on the sample complexity of such divergences. Since, the privacy level depends on the amount of Gaussian smoothing, we analyze the impact of this parameter on the divergence. We support our theoretical findings with empirical studies of Gaussian smoothed and sliced version of Wassertein distance, Sinkhorn divergence and maximum mean discrepancy (MMD). In the context of privacy-preserving domain adaptation, we confirm that those Gaussian smoothed sliced Wasserstein and MMD divergences perform very well while ensuring data privacy.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 16 of its 32 references that are in the map. First posted on arXiv 20 Oct 2021.

Builds on

16 of 32 references.

References · 16

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
  3. 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,329
  4. 2018Computational Optimal Transportcited by 780
  5. 2017Learning Generative Models with Sinkhorn Divergencescited by 314
  6. 2019Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptationcited by 235
  7. 2019Generalized Sliced Wasserstein Distancescited by 208
  8. 2018Improving GANs Using Optimal Transportcited by 123
  9. 2019Max-Sliced Wasserstein Distance and its use for GANscited by 119
  10. 2016Generative Models and Model Criticism via Optimized Maximum Mean Discrepancycited by 100
  11. 2020Statistical and Topological Properties of Sliced Probability Divergencescited by 85
  12. 2020Distributional Sliced-Wasserstein and Applications to Generative Modelingcited by 69
4 more
  1. 2015Sliced Wasserstein Kernels for Probability Distributionscited by 65
  2. 2019Sliced Wasserstein Generative Modelscited by 61
  3. 2021Differentially Private Sliced Wasserstein Distancecited by 19
  4. 2021Smooth p-Wasserstein Distance: Structure, Empirical Approximation, and Statistical Applicationscited by 15

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 3; 2023: 3; 2024: 0; 2025: 0; 2026: 1.

7 papers.