Tree-Sliced Wasserstein Distance with Nonlinear Projection
Not on the map. Why?
Abstract (arXiv)
Tree-Sliced methods have recently emerged as an alternative to the traditional Sliced Wasserstein (SW) distance, replacing one-dimensional lines with tree-based metric spaces and incorporating a splitting mechanism for projecting measures. This approach enhances the ability to capture the topological structures of integration domains in Sliced Optimal Transport while maintaining low computational costs. Building on this foundation, we propose a novel nonlinear projectional framework for the Tree-Sliced Wasserstein (TSW) distance, substituting the linear projections in earlier versions with general projections, while ensuring the injectivity of the associated Radon Transform and preserving the well-definedness of the resulting metric. By designing appropriate projections, we construct efficient metrics for measures on both Euclidean spaces and spheres. Finally, we validate our proposed metric through extensive numerical experiments for Euclidean and spherical datasets. Applications include gradient flows, self-supervised learning, and generative models, where our methods demonstrate significant improvements over recent SW and TSW variants.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 45 of its 71 references that are in the map. First posted on arXiv 2 May 2025.
Builds on
45 of 71 references.
References · 45
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,058
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2021Tackling the Generative Learning Trilemma with Denoising Diffusion GANscited by 516
- 2019Generalized Sliced Wasserstein Distancescited by 208
- 2018Improving GANs Using Optimal Transportcited by 123
- 2019Max-Sliced Wasserstein Distance and its use for GANscited by 119
- 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 93
- 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
- 2020Distributional Sliced-Wasserstein and Applications to Generative Modelingcited by 69
33 more
- 2019Tree-Sliced Variants of Wasserstein Distancescited by 54
- 2021Point-set Distances for Learning Representations of 3D Point Cloudscited by 48
- 2021Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projectionscited by 33
- 2022Spherical Sliced-Wassersteincited by 31
- 2020Optimal Transport Kernels for Sequential and Parallel Neural Architecture Searchcited by 29
- 2021Outlier-Robust Optimal Transport: Duality, Structure, and Statistical Analysiscited by 27
- 2022Bending Graphs: Hierarchical Shape Matching using Gated Optimal Transportcited by 24
- 2023Quasi-Monte Carlo for 3D Sliced Wassersteincited by 22
- 2024Equivariant Neural Functional Networks for Transformerscited by 22
- 2022Sobolev Transport: A Scalable Metric for Probability Measures with Graph Metricscited by 18
- 2018Dynamical Optimal Transport on Discrete Surfacescited by 17
- 2024Monomial Matrix Group Equivariant Neural Functional Networkscited by 17
- 2022Hyperbolic Sliced-Wasserstein via Geodesic and Horospherical Projectionscited by 16
- 2023Sliced Wasserstein Estimation with Control Variatescited by 16
- 2024Sliced Wasserstein with Random-Path Projecting Directionscited by 15
- 2021On the complexity of the optimal transport problem with graph-structured costcited by 14
- 2024Stereographic Spherical Sliced Wasserstein Distancescited by 12
- 2024Bridging Vision and Language Spaces with Assignment Predictioncited by 11
- 2024Equivariant Polynomial Functional Networkscited by 11
- 2021Fixed Support Tree-Sliced Wasserstein Barycentercited by 10
- 2023Dynamic Flows on Curved Space Generated by Labeled Datacited by 10
- 2024Revisiting Deep Audio-Text Retrieval Through the Lens of Transportationcited by 10
- 2021Entropy Regularized Optimal Transport Independence Criterioncited by 9
- 2022Approximating 1-Wasserstein Distance with Treescited by 9
- 2024Generalized Sobolev Transport for Probability Measures on a Graphcited by 9
- 2023Optimal Transport for Measures with Noisy Tree Metriccited by 7
- 2024Tree-Sliced Wasserstein Distance: A Geometric Perspectivecited by 7
- 2022Many processors, little time: MCMC for partitions via optimal transport couplingscited by 6
- 2023Scalable Counterfactual Distribution Estimation in Multivariate Causal Modelscited by 6
- 2024A Clifford Algebraic Approach to E(n)-Equivariant High-order Graph Neural Networkscited by 5
- 2025Distance-Based Tree-Sliced Wasserstein Distancecited by 4
- 2023Few-Shot Object Detection via Synthetic Features with Optimal Transportcited by 3
- 2025Spherical Tree-Sliced Wasserstein Distancecited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.