Pith. sign in

REVIEW 1 cited by

Learning phylogenetic trees as hyperbolic point configurations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2104.11430 v2 pith:CIZTD2HJ submitted 2021-04-23 cs.LG

classification cs.LG
keywords pointfunctiontreeconfigurationconfigurationsdistancehyperboliclog-likelihood
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Hyperbolic Residual Quantization: Discrete Representations for Data with Latent Hierarchies

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Performing residual quantization with hyperbolic operations and distance instead of Euclidean ones yields discrete multitoken representations that improve downstream hypernym generation and recommendation.

Pith tools