Skip to content
Preprint

Causal dictionary learning reveals and validates transcription-factor binding features in genomic language models

Jul 2026 · 0 citations · 31 references
Biology Computer Science

TL;DR

A framework that combines sparse dictionary learning with causal intervention to extract, validate, and causally test interpretable features in genomic foundation models is introduced, and a reusable standard for interpretability claims in genomic deep learning is provided.

Abstract

Genomic language models achieve strong performance across regulatory-genomics tasks, yet what these models internally represent remains opaque, and the field lacks a principled procedure for verifying that an apparent ``concept''inside a model is real rather than an artifact of sequence composition. We introduce a framework that combines sparse dictionary learning with causal intervention to extract, validate, and causally test interpretable features in genomic foundation models. Training top-$k$ sparse autoencoders on the hidden activations of two architecturally distinct models, Nucleotide Transformer ($6$-mer tokenization) and DNABERT-2 (byte-pair encoding), we recover thousands of monosemantic features that map to transcription-factor (TF) sequence motifs. We show that the naive validation of such features against position weight matrices is severely confounded by GC composition and repetitive elements, producing hundreds of spurious ``TF features'', and we develop a composition-matched, binding-resolved protocol that removes these confounds. Critically, we move beyond correlation: by ablating individual dictionary directions during the model's forward pass and measuring the induced shift in the model's own predictive distribution, we establish that specific features are \emph{causally} used to represent cell-type-specific TF binding, not merely motif presence. Across three transcription factors (CTCF, GATA1, REST) and both architectures, causally validated binding features emerge reproducibly ($7$--$14$ of $15$ tested features per condition), while two classes of negative control, scrambled binding labels and randomly selected features, yield no detectable signal. The framework is purely computational, uses only public data, and provides a reusable standard for interpretability claims in genomic deep learning.

View source

Similar papers

Preprint Aug 2026

Frozen but Not Always Accessible: A Representation Analysis of Genomic Language Models

A representation-accessibility analysis of frozen genomic language models across regulatory, epigenetic, promoter, splice-site, and variant-effect prediction tasks shows that local biological signal is partially present in frozen representations, but is not always accessible through final pooled embeddings.

Nirjhor Datta, Swakkhar Shatabda, M. Rahman · 0 citations
Open access Aug 2026

Sparse Autoencoders Reveal Structural and Family-level Features in BiRNA-BERT

SPIRAL is presented, a layer-wise SAE analysis of BiRNA-BERT, a layer-wise SAE analysis of RNA language models where byte-pair tokenization breaks the one-token-one-nucleotide correspondence that nucleotide-level attribution assumes.

M. Hossain, MD. Roqunuzzaman Sojib, Md Toki Tahmid et al. · 0 citations
Preprint Aug 2026

Interpreting Latent Protein Language Model Features with Geometric Annotations

This work introduces an automated and scalable method for interpreting SAE features in ESM-2 by using geometrically inspired features of the protein $\text{C}_\alpha$ backbone, providing a robust method of annotating proteins activated within SAE neurons at a residue level, providing a bridge between mechanistic interp...

S. Setlur, Djordje Mihajlovic, Darrick Lee · 0 citations
Open access Aug 2026

PARNET: A CLIP-SEQ-BASED FOUNDATION MODEL FOR RNA SEQUENCE REPRESENTATION LEARNING

Parnet is a multi-task foundation model trained end-to-end on 223 eCLIP-seq experiments spanning 150 RBPs to predict base-resolution RBP binding profiles directly from RNA sequence, and establishes the RBP interactome as a compact, functionally sufficient, and interpretable basis for foundation model pretraining in RNA...

Lambert Moyon, Andreina Tirabassi, Artem Baranowskii et al. · 0 citations
Book Open access Aug 2026

MotRNA: Encoding RNA Motifs via Explicit N-gram Memory

Crucially, the analysis reveals that the backbone encoder becomes self-contained post-training: the memory module facilitates the internalization of motif semantics into the model parameters, allowing the backbone to retain performance advantages even when the memory is detached during inference.

Xiangyu Ji, Xin Wang, Yang Zhang et al. · 0 citations
Review Jul 2026

Genomic language models (gLMs): Emerging applications, challenges, and future directions in computational genomics.

Across the included studies, stronger evidence for gLM utility was generally associated with biologically informed or task-aligned model design, including evolutionary alignments, motif-aware objectives, long-context architectures, RNA structural priors, population-aware representations, and domain-specific pretraining...

Mahinaz A. Mashhour, M. A. Wahed, Mai S. Mabrouk · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.