paper-with-me

Papers

Tree-Sliced Wasserstein Distance: A Geometric Perspective

2024-06-19 · Viet-Hoang Tran, Trang Pham, Tho Tran, Minh Khoi Nguyen Nhat, Thanh Chu, Tam Le, Tan M. Nguyen

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.

📄 PDF Abstract BibTeX arXiv:2406.13725

Code (0)

등록된 구현이 없습니다.

Tasks

Computational EfficiencyStyle Transfer

Similar Papers 제목 키워드 기반

Tree-Sliced Variants of Wasserstein Distances

2019-02-01 · NeurIPS 2019 12 · Tam Le, Makoto Yamada, Kenji Fukumizu, Marco Cuturi

Optimal transport (\OT) theory defines a powerful set of tools to compare probability distributions. \OT~suffers however from a few drawbacks, computational and statistical, which have encouraged the proposal of several …

Fixed Support Tree-Sliced Wasserstein Barycenter

2021-09-08 · Yuki Takezawa, Ryoma Sato, Zornitsa Kozareva, Sujith Ravi 외

The Wasserstein barycenter has been widely studied in various fields, including natural language processing, and computer vision. However, it requires a high computational cost to solve the Wasserstein barycenter problem…

Distance-Based Tree-Sliced Wasserstein Distance

2025-03-14 · Hoang V. Tran, Khoi N. M. Nguyen, Trang Pham, Thanh T. Chu 외

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 b…

Computational EfficiencyGPU

Spherical Tree-Sliced Wasserstein Distance

2025-03-14 · Hoang V. Tran, Thanh T. Chu, Khoi N. M. Nguyen, Trang Pham 외

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 t…

Self-Supervised Learning

Differentially Private Sliced Wasserstein Distance

2021-07-05 · Alain Rakotomamonjy, Liva Ralaivola

Developing machine learning methods that are privacy preserving is today a central topic of research, with huge practical impacts. Among the numerous ways to address privacy-preserving learning, we here take the perspect…

Domain AdaptationPrivacy Preserving