mlsanityData to 14 Oct 2026

Tree-Sliced Wasserstein Distance: A Geometric Perspective

arXiv 2406.13725 ↗First posted 19 Jun 2024cs.LG cs.AI stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

Many variants of Optimal Transport (OT) have been developed to address its heavy computation. Among them, notably, Sliced Wasserstein (SW) is widely used for application domains by projecting the OT problem onto one-dimensional lines, and leveraging the closed-form expression of the univariate OT to reduce the computational burden. However, projecting measures onto low-dimensional spaces can lead to a loss of topological information. To mitigate this issue, in this work, we propose to replace one-dimensional lines with a more intricate structure, called tree systems. This structure is metrizable by a tree metric, which yields a closed-form expression for OT problems on tree systems. We provide an extensive theoretical analysis to formally define tree systems with their topological properties, introduce the concept of splitting maps, which operate as the projection mechanism onto these structures, then finally propose a novel variant of Radon transform for tree systems and verify its injectivity. This framework leads to an efficient metric between measures, termed Tree-Sliced Wasserstein distance on Systems of Lines (TSW-SL). By conducting a variety of experiments on gradient flows, image style transfer, and generative models, we illustrate that our proposed approach performs favorably compared to SW and its variants.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 49 of its 80 references that are in the map. First posted on arXiv 19 Jun 2024.

Builds on

49 of 80 references.

References · 49

  1. 2020Denoising Diffusion Probabilistic Modelscited by 21,076
  2. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,058
  3. 2022Generative Adversarial Networkscited by 5,627
  4. 2016Improved Techniques for Training GANscited by 2,970
  5. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
  6. 2021Tackling the Generative Learning Trilemma with Denoising Diffusion GANscited by 516
  7. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 282
  8. 2019Generalized Sliced Wasserstein Distancescited by 208
  9. 2018Improving GANs Using Optimal Transportcited by 123
  10. 2019Max-Sliced Wasserstein Distance and its use for GANscited by 119
  11. 2018Generative Modeling using the Sliced Wasserstein Distancecited by 108
  12. 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 93
37 more
  1. 2019Subspace Robust Wasserstein Distancescited by 90
  2. 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
  3. 2018Sliced-Wasserstein Flows: Nonparametric Generative Modeling via Optimal Transport and Diffusionscited by 77
  4. 2020Distributional Sliced-Wasserstein and Applications to Generative Modelingcited by 69
  5. 2019Sliced Wasserstein Generative Modelscited by 61
  6. 2019Tree-Sliced Variants of Wasserstein Distancescited by 54
  7. 2017Multilevel Clustering via Wasserstein Meanscited by 49
  8. 2021Point-set Distances for Learning Representations of 3D Point Cloudscited by 48
  9. 2023Energy-Based Sliced Wasserstein Distancecited by 39
  10. 2020On Projection Robust Optimal Transport: Sample Complexity and Model Misspecificationcited by 34
  11. 2021Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projectionscited by 33
  12. 2017Structured Optimal Transportcited by 31
  13. 2020Optimal Transport Kernels for Sequential and Parallel Neural Architecture Searchcited by 29
  14. 2020A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distancecited by 27
  15. 2021Outlier-Robust Optimal Transport: Duality, Structure, and Statistical Analysiscited by 27
  16. 2022Bending Graphs: Hierarchical Shape Matching using Gated Optimal Transportcited by 24
  17. 2023Quasi-Monte Carlo for 3D Sliced Wassersteincited by 22
  18. 2021Efficient Gradient Flows in Sliced-Wasserstein Spacecited by 21
  19. 2022Sliced Optimal Partial Transportcited by 20
  20. 2019Subspace Detours: Building Transport Plans that are Optimal on Subspace Projectionscited by 19
  21. 2022Sobolev Transport: A Scalable Metric for Probability Measures with Graph Metricscited by 18
  22. 2018Dynamical Optimal Transport on Discrete Surfacescited by 17
  23. 2022Amortized Projection Optimization for Sliced Wasserstein Generative Modelscited by 17
  24. 2022Hyperbolic Sliced-Wasserstein via Geodesic and Horospherical Projectionscited by 16
  25. 2023Sliced Wasserstein Estimation with Control Variatescited by 16
  26. 2024Sliced Wasserstein with Random-Path Projecting Directionscited by 15
  27. 2021On the complexity of the optimal transport problem with graph-structured costcited by 14
  28. 2024Bridging Vision and Language Spaces with Assignment Predictioncited by 11
  29. 2021Fixed Support Tree-Sliced Wasserstein Barycentercited by 10
  30. 2023Dynamic Flows on Curved Space Generated by Labeled Datacited by 10
  31. 2024Revisiting Deep Audio-Text Retrieval Through the Lens of Transportationcited by 10
  32. 2021Entropy Regularized Optimal Transport Independence Criterioncited by 9
  33. 2024Generalized Sobolev Transport for Probability Measures on a Graphcited by 9
  34. 2023Optimal Transport for Measures with Noisy Tree Metriccited by 7
  35. 2022Many processors, little time: MCMC for partitions via optimal transport couplingscited by 6
  36. 2023Scalable Counterfactual Distribution Estimation in Multivariate Causal Modelscited by 6
  37. 2023Few-Shot Object Detection via Synthetic Features with Optimal Transportcited by 3

Built on by

Cited by year (2026 to 14 Oct)

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

7 papers.