Research map / Learning theory and algorithms / Optimal transport
Revisiting Tree-Sliced Wasserstein Distance Through the Lens of the Fermat–Weber Problem
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.
Closest papers by meaning
- Tree-Sliced Wasserstein Distance with Nonlinear Projection (ICML 2025 · similarity 0.94)
- Distance-Based Tree-Sliced Wasserstein Distance (ICLR 2025 · similarity 0.93)
- A Novel Sliced Fused Gromov-Wasserstein Distance (AAAI 2026 · similarity 0.92)
- Tree-Sliced Wasserstein Distance: A Geometric Perspective (ICML 2025 · similarity 0.92)
- 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.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.