Performing residual quantization with hyperbolic operations and distance instead of Euclidean ones yields discrete multitoken representations that improve downstream hypernym generation and recommendation.
Learning phylogenetic trees as hyperbolic point configurations
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Hyperbolic Residual Quantization: Discrete Representations for Data with Latent Hierarchies
Performing residual quantization with hyperbolic operations and distance instead of Euclidean ones yields discrete multitoken representations that improve downstream hypernym generation and recommendation.