mlsanityData to 7 Oct 2026

Learning phylogenetic trees as hyperbolic point configurations

arXiv 2104.11430 ↗First posted 23 Apr 2021cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

We propose a novel method for the inference of phylogenetic trees that utilises point configurations on hyperbolic space as its optimisation landscape. Each taxon corresponds to a point of the point configuration, while the evolutionary distance between taxa is represented by the geodesic distance between their corresponding points. The point configuration is iteratively modified to increase an objective function that additively combines pairwise log-likelihood terms. After convergence, the final tree is derived from the inter-point distances using a standard distance-based method. The objective function, which is shown to mimic the log-likelihood on tree space, is a differentiable function on a Riemannian manifold. Thus gradient-based optimisation techniques can be applied, avoiding the need for combinatorial rearrangements of tree topology.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 7 of its 40 references that are in the map. First posted on arXiv 23 Apr 2021.

Builds on

7 of 40 references.

References · 7

  1. 2018Hyperbolic Neural Networkscited by 393
  2. 2018Learning Continuous Hierarchies in the Lorentz Model of Hyperbolic Geometrycited by 261
  3. 2018Representation Tradeoffs for Hyperbolic Embeddingscited by 204
  4. 2018Poincar'e GloVe: Hyperbolic Word Embeddingscited by 155
  5. 2020From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clusteringcited by 65
  6. 2018Skip-gram word embeddings in hyperbolic spacecited by 19
  7. 2018Gradient descent in hyperbolic spacecited by 11

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 0; 2025: 1.

3 papers.