Hyperbolic Genome Embeddings
Not on the map. Why?
Abstract (arXiv)
Current approaches to genomic sequence modeling often struggle to align the inductive biases of machine learning models with the evolutionarily-informed structure of biological systems. To this end, we formulate a novel application of hyperbolic CNNs that exploits this structure, enabling more expressive DNA sequence representations. Our strategy circumvents the need for explicit phylogenetic mapping while discerning key properties of sequences pertaining to core functional and regulatory behavior. Across 37 out of 42 genome interpretation benchmark datasets, our hyperbolic models outperform their Euclidean equivalents. Notably, our approach even surpasses state-of-the-art performance on seven GUE benchmark datasets, consistently outperforming many DNA language models while using orders of magnitude fewer parameters and avoiding pretraining. Our results include a novel set of benchmark datasets--the Transposable Elements Benchmark--which explores a major but understudied component of the genome with deep evolutionary significance. We further motivate our work by exploring how our hyperbolic models recognize genomic signal under various data-generating conditions and by constructing an empirical method for interpreting the hyperbolicity of dataset embeddings. Throughout these assessments, we find persistent evidence highlighting the potential of our hyperbolic framework as a robust paradigm for genome representation learning. Our code and benchmark datasets are available at https://github.com/rrkhan/HGE.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 29 of its 73 references that are in the map. First posted on arXiv 29 Jul 2025.
Builds on
29 of 73 references.
References · 29
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2018Hyperbolic Neural Networkscited by 402
- 2019Hyperbolic Graph Convolutional Neural Networkscited by 402
- 2023Hyena Hierarchy: Towards Larger Convolutional Language Modelscited by 393
- 2018Learning Continuous Hierarchies in the Lorentz Model of Hyperbolic Geometrycited by 265
- 2019Hyperbolic Image Embeddingscited by 221
- 2020Low-Dimensional Hyperbolic Knowledge Graph Embeddingscited by 195
- 2018Riemannian Adaptive Optimization Methodscited by 194
- 2023HyenaDNA: Long-Range Genomic Sequence Modeling at Single Nucleotide Resolutioncited by 194
- 2018Poincar'e GloVe: Hyperbolic Word Embeddingscited by 156
- 2018Hyperbolic Attention Networkscited by 122
- 2024Caduceus: Bi-Directional Equivariant Long-Range DNA Sequence Modelingcited by 113
17 more
- 2019Continuous Hierarchical Representations with Poincar'e Variational Auto-Encoderscited by 112
- 2021Fully Hyperbolic Neural Networkscited by 108
- 2019Mixed-curvature Variational Autoencoderscited by 86
- 2020From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clusteringcited by 65
- 2017Neural Embeddings of Graphs in Hyperbolic Spacecited by 58
- 2020Differentiating through the Fr'echet Meancited by 53
- 2023Fully Hyperbolic Convolutional Neural Networks for Computer Visioncited by 49
- 2020Capturing implicit hierarchical structure in 3D biomedical images with self-supervised hyperbolic representationscited by 24
- 2021Neural Distance Embeddings for Biological Sequencescited by 17
- 2023To Transformers and Beyond: Large Language Models for the Genomecited by 15
- 2022Autoencoding Hyperbolic Representation for Adversarial Generationcited by 7
- 2023Fast hyperboloid decision tree algorithmscited by 7
- 2014Topological implications of negative curvature for biological and social networkscited by 4
- 2015Hyperbolicity Measures "Democracy" in Real-World Networkscited by 4
- 2020Evolution Is All You Need: Phylogenetic Augmentation for Contrastive Learningcited by 3
- 2025Variational Combinatorial Sequential Monte Carlo for Bayesian Phylogenetics in Hyperbolic Spacecited by 3
- 2025Manify: A Python Library for Learning Non-Euclidean Representationscited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.