mlsanityData to 14 Oct 2026

Slicing Wasserstein Over Wasserstein Via Functional Optimal Transport

arXiv 2509.22138 ↗First posted 26 Sep 2025cs.LG math.MG math.OCcited by 5

Not on the map. Why?

Abstract (arXiv)

Wasserstein distances define a metric between probability measures on arbitrary metric spaces, including meta-measures (measures over measures). The resulting Wasserstein over Wasserstein (WoW) distance is a powerful, but computationally costly tool for comparing datasets or distributions over images and shapes. Existing sliced WoW accelerations rely on parametric meta-measures or the existence of high-order moments, leading to numerical instability. As an alternative, we propose to leverage the isometry between the 1d Wasserstein space and the quantile functions in the function space L2([0,1]). For this purpose, we introduce a general sliced Wasserstein framework for arbitrary Banach spaces. Due to the 1d Wasserstein isometry, this framework defines a sliced distance between 1d meta-measures via infinite-dimensional L2-projections, parametrized by Gaussian processes. Combining this 1d construction with classical integration over the Euclidean unit sphere yields the double-sliced Wasserstein (DSW) metric for general meta-measures. We show that DSW minimization is equivalent to WoW minimization for discretized meta-measures, while avoiding unstable higher-order moments and computational savings. Numerical experiments on datasets, shapes, and images validate DSW as a scalable substitute for the WoW distance.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 53 of its 88 references that are in the map. First posted on arXiv 26 Sep 2025.

Builds on

53 of 88 references.

References · 53

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  3. 2018Demystifying MMD GANscited by 1,293
  4. 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 879
  5. 2019PointFlow: 3D Point Cloud Generation with Continuous Normalizing Flowscited by 488
  6. 2017Learning Generative Models with Sinkhorn Divergencescited by 314
  7. 2018Gaussian Processes and Kernel Methods: A Review on Connections and Equivalencescited by 192
  8. 2020Geometric Dataset Distances via Optimal Transportcited by 158
  9. 2020Statistical and Topological Properties of Sliced Probability Divergencescited by 85
  10. 2019A Wasserstein-type distance in the space of Gaussian Mixture Modelscited by 75
  11. 2020Distributional Sliced-Wasserstein and Applications to Generative Modelingcited by 69
  12. 2019Hierarchical Optimal Transport for Document Representationcited by 53
38 more
  1. 2021Point-set Distances for Learning Representations of 3D Point Cloudscited by 48
  2. 2017Optimal transport for Gaussian mixture modelscited by 45
  3. 2024Meta Flow Matching: Integrating Vector Fields on the Wasserstein Manifoldcited by 43
  4. 2023Energy-Based Sliced Wasserstein Distancecited by 39
  5. 2019Hierarchical Optimal Transport for Multimodal Distribution Alignmentcited by 38
  6. 2023Multilevel Diffusion: Infinite Dimensional Score-Based Diffusion Models for Image Generationcited by 37
  7. 2021Wasserstein GANs Work Because They Fail (to Approximate the Wasserstein Distance)cited by 35
  8. 2021Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projectionscited by 33
  9. 2022Spherical Sliced-Wassersteincited by 31
  10. 2015The Radon cumulative distribution transform and its application to image classificationcited by 28
  11. 2024Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifoldscited by 28
  12. 2024Wasserstein Flow Matching: Generative modeling over families of distributionscited by 28
  13. 2022Generating natural images with direct Patch Distributions Matchingcited by 27
  14. 2022Revisiting Sliced Wasserstein on Images: From Vectorization to Convolutioncited by 25
  15. 2023Quasi-Monte Carlo for 3D Sliced Wassersteincited by 22
  16. 2023Sliced-Wasserstein on Symmetric Positive Definite Matrices for M/EEG Signalscited by 19
  17. 2020Fast and Robust Comparison of Probability Measures in Heterogeneous Spacescited by 17
  18. 2021On a linear Gromov-Wasserstein distancecited by 17
  19. 2022Hyperbolic Sliced-Wasserstein via Geodesic and Horospherical Projectionscited by 16
  20. 2024Multiscale Sliced Wasserstein Distances as Perceptual Color Difference Measurescited by 14
  21. 2021Wasserstein Patch Prior for Image Superresolutioncited by 13
  22. 2020A Generative Model for Texture Synthesis based on Optimal Transport between Feature Distributionscited by 12
  23. 2021Unbalanced Multi-Marginal Optimal Transportcited by 11
  24. 2023Sample Path Regularity of Gaussian Processes from the Covariance Kernelcited by 11
  25. 2025Flowing Datasets with Wasserstein over Wasserstein Gradient Flowscited by 11
  26. 2021Hierarchical Optimal Transport for Unsupervised Domain Adaptationcited by 10
  27. 2024Parallelly Sliced Optimal Transport on Spheres and on the Rotation Groupcited by 10
  28. 2025Lightspeed Geometric Dataset Distance via Sliced Optimal Transportcited by 10
  29. 2023Learning from small data sets: Patch-based regularizers in inverse problems for image reconstructioncited by 9
  30. 2024Validating Climate Models with Spherical Convolutional Wasserstein Distancecited by 9
  31. 2025A Novel Sliced Fused Gromov-Wasserstein Distancecited by 9
  32. 2023Wasserstein Gradient Flows for Optimizing Gaussian Mixture Policiescited by 8
  33. 2024T-FAKE: Synthesizing Thermal Images for Facial Landmarkingcited by 7
  34. 2024Fast Summation of Radial Kernels via QMC Slicingcited by 7
  35. 2025Slicing the Gaussian Mixture Wasserstein Distancecited by 7
  36. 2025Differentiable Generalized Sliced Wasserstein Planscited by 7
  37. 2022Universal Neural Optimal Transportcited by 6
  38. 2024Hierarchical Hybrid Sliced Wasserstein: A Scalable Metric for Heterogeneous Joint Distributionscited by 6

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 4.

5 papers.