mlsanityData to 7 Oct 2026

A User's Guide to Sampling Strategies for Sliced Optimal Transport

arXiv 2502.02275 ↗First posted 4 Feb 2025cs.LG math.PRcited by 7

Not on the map. Why?

Abstract (arXiv)

This paper serves as a user's guide to sampling strategies for sliced optimal transport. We provide reminders and additional regularity results on the Sliced Wasserstein distance. We detail the construction methods, generation time complexity, theoretical guarantees, and conditions for each strategy. Additionally, we provide insights into their suitability for sliced optimal transport in theory. Extensive experiments on both simulated and real-world data offer a representative comparison of the strategies, culminating in practical recommendations for their best usage.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 18 of its 69 references that are in the map. First posted on arXiv 4 Feb 2025.

Builds on

18 of 69 references.

References · 18

  1. 2015ShapeNet: An Information-Rich 3D Model Repositorycited by 2,880
  2. 2017Improved Training of Wasserstein GANscited by 2,223
  3. 2015Optimal Transport for Domain Adaptationcited by 457
  4. 2019Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptationcited by 235
  5. 2018Improving GANs Using Optimal Transportcited by 122
  6. 2018Generative Modeling using the Sliced Wasserstein Distancecited by 108
  7. 2017Sliced Wasserstein Kernel for Persistence Diagramscited by 77
  8. 2019Sliced Wasserstein Generative Modelscited by 61
  9. 2017Optimal Transport for Diffeomorphic Registrationcited by 39
  10. 2019Orthogonal Estimation of Wasserstein Distancescited by 32
  11. 2024Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifoldscited by 28
  12. 2022Generating natural images with direct Patch Distributions Matchingcited by 26
6 more
  1. 2021Wasserstein Distances, Geodesics and Barycenters of Merge Treescited by 16
  2. 2023Sliced Wasserstein Estimation with Control Variatescited by 16
  3. 2021Wasserstein Patch Prior for Image Superresolutioncited by 13
  4. 2024Integrating Efficient Optimal Transport and Functional Maps For Unsupervised Shape Correspondence Learningcited by 12
  5. 2024Sliced-Wasserstein Estimation with Spherical Harmonics as Control Variatescited by 8
  6. 2024Linear Spherical Sliced Optimal Transport: A Fast Metric for Comparing Spherical Datacited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 5; 2026: 2.

7 papers.

  1. 2025Fast Estimation of Wasserstein Distances via Regression on Sliced Wasserstein Distancescited by 5
  2. 2026Convergence Rates for Distribution Matching with Sliced Optimal Transportcited by 2
  3. 2025Keep your distance: learning dispersed embeddings on mathbbSmcited by 1
  4. 2025Repulsive Monte Carlo on the sphere for the sliced Wasserstein distancecited by 1
  5. 2025Streaming Sliced Optimal Transportcited by 0
  6. 2025Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimizationcited by 0
  7. 2026Sierpi'nski--Knopp Wasserstein Distance for Persistence Diagrams and Applications to 2-Wasserstein Approximationcited by 0