Preprint · 2020 · Open access
Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embedding
arXiv (Cornell University) · Published 8 May 2020 · DOI 10.48550/arxiv.2005.03847
In brief
“Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embedding” is a 2020 preprint by Rishi Sonthalia and Anna C. Gilbert, published in arXiv (Cornell University). OpenAlex counts 46 citations as of 22 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 46
- Most cited in
- 2024 (16)
- References
- 39
- Authors
- 2
Abstract
Given data, finding a faithful low-dimensional hyperbolic embedding of the data is a key method by which we can extract hierarchical information or learn representative geometric features of the data. In this paper, we explore a new method for learning hyperbolic representations by taking a metric-first approach. Rather than determining the low-dimensional hyperbolic embedding directly, we learn a tree structure on the data. This tree structure can then be used directly to extract hierarchical information, embedded into a hyperbolic manifold using Sarkar's construction \cite{sarkar}, or used as a tree approximation of the original metric. To this end, we present a novel fast algorithm \textsc{TreeRep} such that, given a $δ$-hyperbolic metric (for any $δ\geq 0$), the algorithm learns a tree structure that approximates the original metric. In the case when $δ= 0$, we show analytically that \textsc{TreeRep} exactly recovers the original tree structure. We show empirically that \textsc{TreeRep} is not only many orders of magnitude faster than previously known algorithms, but also produces metrics with lower average distortion and higher mean average precision than most previous algorithms for learning hyperbolic embeddings, extracting hierarchical information, and approximating metrics via tree metrics.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Sonthalia, R., & Gilbert, A. C. (2020). Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embedding. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2005.03847
MLA 9
Sonthalia, Rishi, and Anna C. Gilbert. “Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embedding.” arXiv (Cornell University), 2020. https://doi.org/10.48550/arxiv.2005.03847.
Chicago
Sonthalia, Rishi and Anna C. Gilbert. 2020. “Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embedding.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2005.03847.
Harvard
Sonthalia, R. and Gilbert, A. C. (2020) ‘Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embedding’, arXiv (Cornell University). doi:10.48550/arxiv.2005.03847.
IEEE
R. Sonthalia and A. C. Gilbert, “Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embedding,” arXiv (Cornell University), 2020, doi: 10.48550/arxiv.2005.03847.
BibTeX
@misc{sonthalia2020tree,
title = {{Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embedding}},
author = {Sonthalia, Rishi and Gilbert, Anna C.},
howpublished = {arXiv (Cornell University)},
year = {2020},
doi = {10.48550/arxiv.2005.03847},
url = {https://doi.org/10.48550/arxiv.2005.03847}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2021 | 3 | |
| 2022 | 6 | |
| 2023 | 10 | |
| 2024 | 16 | |
| 2025 | 6 | |
| 2026 | 5 |
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
- hyperbolic embeddings
- metric approximation
- tree metrics
- metric distortion
- low-dimensional embedding
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Sonthalia, R., & Gilbert, A. C. (2020). Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embedding. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2005.03847
How many times has this paper been cited?
46 times, according to OpenAlex on 22 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Rishi Sonthalia, Anna C. Gilbert.
What is the DOI of this paper?
10.48550/arxiv.2005.03847, permanently at https://doi.org/10.48550/arxiv.2005.03847. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 22 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.