Pith. sign in

REVIEW 1 cited by

Variational Combinatorial Sequential Monte Carlo for Bayesian Phylogenetics in Hyperbolic Space

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 2501.17965 v2 pith:R6SXNCJI submitted 2025-01-29 cs.LG stat.ML

classification cs.LGstat.ML
keywords hyperbolictextsccombinatorialinferencesequentialspacecarlomethods
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Hyperbolic space naturally encodes hierarchical structures such as phylogenies (binary trees), where inward-bending geodesics reflect paths through least common ancestors, and the exponential growth of neighborhoods mirrors the super-exponential scaling of topologies. This scaling challenge limits the efficiency of Euclidean-based approximate inference methods. Motivated by the geometric connections between trees and hyperbolic space, we develop novel hyperbolic extensions of two sequential search algorithms: Combinatorial and Nested Combinatorial Sequential Monte Carlo (\textsc{Csmc} and \textsc{Ncsmc}). Our approach introduces consistent and unbiased estimators, along with variational inference methods (\textsc{H-Vcsmc} and \textsc{H-Vncsmc}), which outperform their Euclidean counterparts. Empirical results demonstrate improved speed, scalability and performance in high-dimensional phylogenetic inference tasks.

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 Genome Embeddings

    cs.LG 2025-07 conditional novelty 6.0 of 10

    Hyperbolic CNNs outperform Euclidean CNNs on 37 of 42 genome classification benchmarks and beat several large DNA language models on 7 GUE tasks using orders of magnitude fewer parameters.

Pith tools