Research map / Learning theory and algorithms / Optimal transport
Fast Unbalanced Optimal Transport on a Tree
Ryoma Sato, Makoto Yamada, Hisashi Kashima
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| Approximate Euclidean GKR with quadtree GKR | GKR · Chicago Crime | Spearman's ρ: larger than 0.9 for most λ | Improved |
| Approximate Euclidean GKR with quadtree GKR | GKR · Chicago Crime | relative error: less than 0.1 for most cases | Improved |
| Use GKR with raw event measures rather than normalized standard OT | NewYork taxi dataset distance visualization · NewYork taxi dataset | anomaly-day separation | Improved |
| Use tree sliced Wasserstein with normalized measures rather than GKR | NewYork taxi dataset distance visualization · NewYork taxi dataset | anomaly-day separation | Hurt |
Closest papers by meaning
- Learning Ultrametric Trees for Optimal Transport Regression (AAAI 2024 · similarity 0.89)
- Tree-Sliced Wasserstein Distance: A Geometric Perspective (ICML 2025 · similarity 0.87)
- A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem (NeurIPS 2024 · similarity 0.87)
- Optimal Transport with Cyclic Symmetry (AAAI 2024 · similarity 0.86)
- An Efficient Orlicz-Sobolev Approach for Transporting Unbalanced Measures on a Graph (NeurIPS 2025 · similarity 0.86)
- Submodular framework for structured-sparse optimal transport (ICML 2024 · similarity 0.85)
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.
