Distance-Based Tree-Sliced Wasserstein Distance
Hoang V. Tran, Minh-Khoi Nguyen-Nhat, Huyen Trang Pham, Thanh T. Chu, Tam Le, Tan Minh Nguyen
Abstract
To overcome computational challenges of Optimal Transport (OT), several variants of Sliced Wasserstein (SW) has been developed in the literature. These approaches exploit the closed-form expression of the univariate OT by projecting measures onto (one-dimensional) lines. However, projecting measures onto lowdimensional spaces can lead to a loss of topological information. Tree-Sliced Wasserstein distance on Systems of Lines (TSW-SL) has emerged as a promising alternative that replaces these lines with a more advanced structure called tree systems. The tree structures enhance the ability to capture topological information of the metric while preserving computational efficiency. However, at the core of TSW-SL, the splitting maps, which serve as the mechanism for pushing forward measures onto tree systems, focus solely on the position of the measure supports while disregarding the projecting domains. Moreover, the specific splitting map used in TSW-SL leads to a metric that is not invariant under Euclidean transformations, a typically expected property for OT on Euclidean space. In this work, we propose a novel class of splitting maps that generalizes the existing one studied in TSW-SL enabling the use of all positional information from input measures, resulting in a novel Distance-based Tree-Sliced Wasserstein (Db-TSW) distance. In addition, we introduce a simple tree sampling process better suited for Db-TSW, leading to an efficient GPU-friendly implementation for tree systems, similar to the original SW. We also provide a comprehensive theoretical analysis of proposed class of splitting maps to verify the injectivity of the corresponding Radon Transform, and demonstrate that Db-TSW is an Euclidean invariant metric. We empirically show that Db-TSW significantly improves accuracy compared to recent SW variants while maintaining low computational cost via a wide range of experiments on gradient flows, image style transfer, and generative models. The code is publicly available at https://github.com/Fsoft-AIC/DbTSW .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 435c8acc-bf2c-408c-8e13-2a1ea24dfab1Cited by top-tier papers12
- On Linear Mode Connectivity of Mixture-of-Experts ArchitecturesViet-Hoang Tran, Van-Hoan Trinh, Khanh Vinh Bui, Tan M. NguyenNeurIPS 2025 · 9 citations
- Tree-Sliced Entropy Partial TransportViet-Hoang Tran, Thanh Tran, Thanh T. Chu, Tam Le et al.NeurIPS 2025 · 3 citations
- Quasi-Equivariant MetanetworksViet-Hoang Tran, An Nguyen The, Benoît Guérand, Thieu Vo et al.ICLR 2026 · 1 citation
- UltraTWD: Optimizing Ultrametric Trees for Tree-Wasserstein DistanceFangchen Yu, Yanzhen Chen, Jiaxing Wei, Jianfeng Mao et al.ICML 2025
- Tree-sliced Sobolev IPMViet-Hoang Tran, Thanh Q. Tran, Thanh T. Chu, Duy-Tung Pham et al.ICLR 2026
Builds on20
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 35,902 citations
- E(n) Equivariant Graph Neural NetworksVictor Garcia Satorras, Emiel Hoogeboom, Max WellingICML 2021 · 1,432 citations
- Tackling the Generative Learning Trilemma with Denoising Diffusion GANsZhisheng Xiao, Karsten Kreis, Arash VahdatICLR 2022 · 726 citations
- Point-set Distances for Learning Representations of 3D Point CloudsTrung Nguyen, Quang-Hieu Pham, Tam Le, Tung Pham et al.ICCV 2021 · 89 citations
- Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random ProjectionsKimia Nadjahi, Alain Durmus, Pierre E. Jacob, Roland Badeau et al.NeurIPS 2021 · 54 citations
Related papers
- Tree-Sliced Wasserstein Distance: A Geometric PerspectiveHoang V. Tran, Huyen Trang Pham, Tho Tran Huu, Minh-Khoi Nguyen-Nhat et al.ICML 2025
- Tree-Sliced Wasserstein Distance with Nonlinear ProjectionThanh Tran, Hoang V. Tran, Thanh T. Chu, Huyen Trang Pham et al.ICML 2025
- Spherical Tree-Sliced Wasserstein DistanceHoang V. Tran, Thanh T. Chu, Minh-Khoi Nguyen-Nhat, Huyen Trang Pham et al.ICLR 2025
- Revisiting Tree-Sliced Wasserstein Distance Through the Lens of the Fermat-Weber ProblemViet-Hoang Tran, Thanh Q. Tran, Thanh T. Chu, Trung-Khang Tran et al.ICLR 2026
- Mixed-Curvature Tree-Sliced Wasserstein DistanceDuy-Tung Pham, Viet-Hoang Tran, Thieu Vo, Tan NguyenICLR 2026
