Research map / Learning theory and algorithms / Optimal transport
Tree-Sliced Variants of Wasserstein Distances
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the tree-sliced Wasserstein kernel instead of the baseline kernels | Document classification and topological data analysis · Word embedding-based document classification; TDA benchmarks | SVM performance | Mixed |
| Use the tree-sliced Wasserstein kernel instead of the OT kernel | Tree-sliced Wasserstein kernel · CLASSIC | kernel computation time | Helped |
| Increase the number of tree slices (ablation) | Tree-sliced Wasserstein kernel · TWITTER | SVM performance | Helped |
| Increase the number of tree slices (ablation) | Tree-sliced Wasserstein distance · MPEG7 and Orbit | W2 near-neighbor rank | Helped |
Closest papers by meaning
- Tree-Sliced Wasserstein Distance: A Geometric Perspective (ICML 2025 · similarity 0.93)
- Distance-Based Tree-Sliced Wasserstein Distance (ICLR 2025 · similarity 0.91)
- Tree-Sliced Wasserstein Distance with Nonlinear Projection (ICML 2025 · similarity 0.91)
- Spherical Tree-Sliced Wasserstein Distance (ICLR 2025 · similarity 0.90)
- Towards Understanding Gradient Dynamics of the Sliced-Wasserstein Distance via Critical Point Analysis (ICML 2025 · similarity 0.90)
- Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances (ICML 2025 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.