Interpreting Genomic Language Models using Sparse Autoencoders
Akira A Nair, Jaehyun Joo, Jonghyun Lee, Lina Takemaru, Yidi Huang, Manu Shivakumar, Matthew Eric Lee, Jaesik Kim
ICML 2026 regular
Abstract (source: OpenReview · © authors)
Genomic language models (gLMs) achieve strong performance across genomic prediction tasks, but their internal biological representations remain poorly understood. Sparse autoencoders (SAEs) have emerged as an interpretability tool in vision and natural language models, yet their applicability to gLMs remains unexplored. We present a systematic study of SAE-based interpretability for gLMs, introducing a diverse benchmark of human genomic annotations and a suite of genome-tailored interpretability metrics. Using Evo2 as a primary case study, we show that SAE features, particularly those from intermediate layers, are more interpretable than raw model embeddings across 42/55 (76%) of our genomic concept evaluations, with 26 of them having an F1 score greater than 0.7. We further find that interpretability depends on SAE training data properties such as evolutionary proximity and context length. Finally, to organize semantically related genomic concepts learned by an SAE, we develop a graph-based representation method that outperforms the baseline approach of using SAE model weights. We demonstrate how our framework can extend SAEs as a powerful approach for not only better understanding gLMs but also for adopting them in disease-driven genomic explorations.
Keywords
Metadata from BioTender-max/icml2026-ai-bio (CC0-1.0). Phở does not host any PDF; links point back to the source.
Related
dnaHNet: A Scalable and Hierarchical Foundation Model for Genomic Sequence Learning
Arnav Shah, Junzhe Li, Parsa Idehpour, Adibvafa Fallahpour +4
Genomic foundation models have the potential to decode DNA syntax, yet face a fundamental tradeoff. Standard subword tokenizers fragment biologically meaningful motifs such as…
Training Diffusion Language Models for Black-Box Optimization
Zipeng Sun, Can Chen, Ye Yuan, Haolun Wu +3
We study offline black-box optimization (BBO), aiming to discover improved designs from an offline dataset of designs and labels, a problem common in robotics, DNA, and materials…
HypoSpace: A Diagnostic Benchmark for Set-Valued Hypothesis Generation under Underdetermination and Sublinear Coverage Bounds
Tingting Chen, Beibei Lin, Zifeng Yuan, Qiran Zou +4
Many scientific problems are underdetermined: multiple distinct hypotheses are equally consistent with the same observations. In such settings, effective inference requires not…