mlsanityData to 7 Oct 2026

Spherical Tree-Sliced Wasserstein Distance

arXiv 2503.11249 ↗First posted 14 Mar 2025cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Sliced Optimal Transport (OT) simplifies the OT problem in high-dimensional spaces by projecting supports of input measures onto one-dimensional lines and then exploiting the closed-form expression of the univariate OT to reduce the computational burden of OT. Recently, the Tree-Sliced method has been introduced to replace these lines with more intricate structures, known as tree systems. This approach enhances the ability to capture topological information of integration domains in Sliced OT while maintaining low computational cost. Inspired by this approach, in this paper, we present an adaptation of tree systems on OT problems for measures supported on a sphere. As a counterpart to the Radon transform variant on tree systems, we propose a novel spherical Radon transform with a new integration domain called spherical trees. By leveraging this transform and exploiting the spherical tree structures, we derive closed-form expressions for OT problems on the sphere. Consequently, we obtain an efficient metric for measures on the sphere, named Spherical Tree-Sliced Wasserstein (STSW) distance. We provide an extensive theoretical analysis to demonstrate the topology of spherical trees and the well-definedness and injectivity of our Radon transform variant, which leads to an orthogonally invariant distance between spherical measures. Finally, we conduct a wide range of numerical experiments, including gradient flows and self-supervised learning, to assess the performance of our proposed metric, comparing it to recent benchmarks.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 37 of its 65 references that are in the map. First posted on arXiv 14 Mar 2025.

Builds on

37 of 65 references.

References · 37

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  3. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  4. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
  5. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  6. 2016Density estimation using Real NVPcited by 2,029
  7. 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,838
  8. 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
  9. 2016Group Equivariant Convolutional Networkscited by 1,154
  10. 2021E(n) Equivariant Graph Neural Networkscited by 951
  11. 2017SphereFace: Deep Hypersphere Embedding for Face Recognitioncited by 733
  12. 2021Neural Descriptor Fields: SE(3)-Equivariant Object Representations for Manipulationcited by 204
25 more
  1. 2020Riemannian Continuous Normalizing Flowscited by 143
  2. 2020Normalizing Flows on Tori and Spherescited by 117
  3. 2019Learning with minibatch Wasserstein : asymptotic and gradient propertiescited by 83
  4. 2018Spherical Latent Spaces for Stable Variational Autoencoderscited by 66
  5. 2021Low-Rank Sinkhorn Factorizationcited by 66
  6. 2018DeepSphere: Efficient spherical Convolutional Neural Network with HEALPix sampling for cosmological applicationscited by 61
  7. 2019Tree-Sliced Variants of Wasserstein Distancescited by 54
  8. 2018Massively scalable Sinkhorn distances via the Nystr"om methodcited by 40
  9. 2018Statistical Optimal Transport via Factored Couplingscited by 38
  10. 2022Spherical Sliced-Wassersteincited by 31
  11. 2020Trajectory Prediction using Equivariant Continuous Convolutioncited by 26
  12. 2024Equivariant Neural Functional Networks for Transformerscited by 20
  13. 2022Sobolev Transport: A Scalable Metric for Probability Measures with Graph Metricscited by 18
  14. 2022Sliced Wasserstein Variational Inferencecited by 17
  15. 2017Graph-Based Classification of Omnidirectional Imagescited by 16
  16. 2024Monomial Matrix Group Equivariant Neural Functional Networkscited by 15
  17. 2020Recent advances in directional statisticscited by 14
  18. 2021Entropy Partial Transport with Tree Metrics: Theory and Practicecited by 13
  19. 2024Stereographic Spherical Sliced Wasserstein Distancescited by 12
  20. 2023Scalable Unbalanced Sobolev Transport for Measures on a Graphcited by 10
  21. 2024Equivariant Polynomial Functional Networkscited by 10
  22. 2024Generalized Sobolev Transport for Probability Measures on a Graphcited by 9
  23. 20233D reconstruction from spherical images: A review of techniques, applications, and prospectscited by 7
  24. 2024Tree-Sliced Wasserstein Distance: A Geometric Perspectivecited by 7
  25. 2024A Clifford Algebraic Approach to E(n)-Equivariant High-order Graph Neural Networkscited by 5

Built on by

Cited by year (2026 to 7 Oct)

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

2 papers.