Siamese networks for Poincaré embeddings and the reconstruction of evolutionary trees
arXiv:2410.07387 · doi:10.1017/S1446181125000148
Abstract
We present a method for reconstructing evolutionary trees from high-dimensional data, with a specific application to bird song spectrograms. We address the challenge of inferring phylogenetic relationships from phenotypic traits, like vocalizations, without predefined acoustic properties. Our approach combines two main components: Poincaré embeddings for dimensionality reduction and distance computation, and the neighbor joining algorithm for tree reconstruction. Unlike previous work, we employ Siamese networks to learn embeddings from only leaf node samples of the latent tree. We demonstrate our method's effectiveness on both synthetic data and spectrograms from six species of finches.
arXiv comment17 pages, 10 figures
References in corpus (9)
- Adam: A Method for Stochastic Optimization
- Efficient Estimation of Word Representations in Vector Space
- Distributed Representations of Words and Phrases and their Compositionality
- Hyperbolic Geometry of Complex Networks
- Navigability of Complex Networks
- Representation Tradeoffs for Hyperbolic Embeddings
- Poincaré Embeddings for Learning Hierarchical Representations
- A Wrapped Normal Distribution on Hyperbolic Space for Gradient-Based Learning
- Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders