Research map / Learning theory and algorithms / Prediction and decision losses
Fitting trees to $\ell_1$-hyperbolic distances
Joon-Hyeok Yim, Anna Gilbert
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 |
|---|---|---|---|
| HCCRootedTreeFit instead of Gromov | tree fitting · C-elegan l1 distortion | average l1 distortion: 1.14 -> 0.90 | Improved |
| HCCRootedTreeFit instead of TreeRep | tree fitting · CS Phd / CORA / Airport l1 | average l1 distortion: 2.55 -> 2.60 | Mixed |
| NeighborJoin instead of TreeRep | tree fitting · CORA l1 distortion | average l1 distortion: 2.91 -> 1.06 | Improved |
| HCCRootedTreeFit instead of Gromov | tree fitting · CS Phd l-infinity | l-infinity error: 13.24 -> 23.37 | Hurt |
| HCCRootedTreeFit instead of NeighborJoin | tree fitting · Synthetic BT(8,3) | average l1 error: 0.03180 -> 0.00443 | Improved |
| HCCRootedTreeFit instead of NeighborJoin | tree fitting · Synthetic BT(2,8) | average l1 error: 0.04360 -> 0.07426 | Hurt |
| Gromov instead of HCCRootedTreeFit | tree fitting · Synthetic BT(8,3) | average l1 error: 0.00443 -> 0.18225 | Hurt |
| use HCCRootedTreeFit over NeighborJoin for runtime | tree fitting · CORA running time | running time (s): 268.45 -> 18.125 | Improved |
| use HCCRootedTreeFit over Gromov for runtime | tree fitting · Airport running time | running time (s): 3.251 -> 28.821 | Hurt |
Closest papers by meaning
- A (1+?)-Approximation for Ultrametric Embedding in Subquadratic Time (AAAI 2025 · similarity 0.87)
- Low-distortion and GPU-compatible Tree Embeddings in Hyperbolic Space (ICML 2025 · similarity 0.87)
- Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature Hierarchy (ICLR 2025 · similarity 0.87)
- Hyperbolic Embeddings of Supervised Models (NeurIPS 2024 · similarity 0.87)
- Bridging Arbitrary and Tree Metrics via Differentiable Gromov Hyperbolicity (NeurIPS 2025 · similarity 0.86)
- Weighted Embeddings for Low-Dimensional Graph Representation (AAAI 2025 · similarity 0.86)
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.
