Tree-Sliced Variants of Wasserstein Distances

Tree-Sliced Variants of Wasserstein Distances

1 February 2019

Papers citing "Tree-Sliced Variants of Wasserstein Distances"

12 / 12 papers shown

Title
Spherical Tree-Sliced Wasserstein Distance Hoang V. Tran Thanh T. Chu K. Nguyen Trang Pham Tam Le Trung Quoc Nguyen OT 68 3 0 14 Mar 2025
All You Need is Resistance: On the Equivalence of Effective Resistance and Certain Optimal Transport Problems on Graphs Sawyer Robertson Zhengchao Wan Alexander Cloninger OT 87 2 0 28 Jan 2025
Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature Hierarchy Ya-Wei Eileen Lin Ronald R. Coifman Zhengchao Wan Ronen Talmon 90 2 0 28 Oct 2024
Learning Structured Representations by Embedding Class Hierarchy with Fast Optimal Transport Siqi Zeng Sixian Du M. Yamada Han Zhao OT 62 1 0 04 Oct 2024
SAVA: Scalable Learning-Agnostic Data Valuation Samuel Kessler Tam Le Vu Nguyen TDI 109 0 0 03 Jun 2024
Computational Optimal Transport Gabriel Peyré Marco Cuturi OT 125 2,133 0 01 Mar 2018
Sliced Wasserstein Kernel for Persistence Diagrams Mathieu Carrière Marco Cuturi S. Oudot 48 238 0 11 Jun 2017
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration Jason M. Altschuler Jonathan Niles-Weed Philippe Rigollet OT 51 586 0 26 May 2017
On Valid Optimal Assignment Kernels and Applications to Graph Classification Nils M. Kriege Pierre-Louis Giscard Richard C. Wilson 62 213 0 03 Jun 2016
Sliced Wasserstein Kernels for Probability Distributions Soheil Kolouri Yang Zou Gustavo K. Rohde 26 159 0 10 Nov 2015
Fast Computation of Wasserstein Barycenters Marco Cuturi Arnaud Doucet OT 73 735 0 16 Oct 2013
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances Marco Cuturi OT 121 4,210 0 04 Jun 2013