English
Related papers

Related papers: Language Model Circuits Are Sparse in the Neuron B…

200 papers

A popular new method in mechanistic interpretability is to train high-dimensional sparse autoencoders (SAEs) on neuron activations and use SAE features as the atomic units of analysis. However, the body of evidence on whether SAE feature…

Machine Learning · Computer Science 2024-09-10 Maheep Chaudhary , Atticus Geiger

The hypothesis of Universality in interpretability suggests that different neural networks may converge to implement similar algorithms on similar tasks. In this work, we investigate two mainstream architectures for language modeling,…

Computation and Language · Computer Science 2024-10-11 Junxuan Wang , Xuyang Ge , Wentao Shu , Qiong Tang , Yunhua Zhou , Zhengfu He , Xipeng Qiu

While sentence simplification is an active research topic in NLP, its adjacent tasks of sentence complexification and same-level paraphrasing are not. To train models on all three tasks, we present two new unsupervised datasets. We compare…

Computation and Language · Computer Science 2023-11-22 Alison Chi , Li-Kuang Chen , Yi-Chen Chang , Shu-Hui Lee , Jason S. Chang

Sparse autoencoders (SAEs) have become a standard tool for mechanistic interpretability in autoregressive large language models (LLMs), enabling researchers to extract sparse, human-interpretable features and intervene on model behavior.…

Machine Learning · Computer Science 2026-02-06 Xu Wang , Bingqing Jiang , Yu Wan , Baosong Yang , Lingpeng Kong , Difan Zou

Sparse autoencoders (SAEs) are a mechanistic interpretability technique that have been used to provide insight into learned concepts within large protein language models. Here, we employ TopK and Ordered SAEs to investigate autoregressive…

Sparse Autoencoders (SAEs) have recently emerged as powerful tools for interpreting and steering the internal representations of large language models (LLMs). However, conventional approaches to analyzing SAEs typically rely solely on…

Machine Learning · Computer Science 2025-09-24 Dong Shu , Xuansheng Wu , Haiyan Zhao , Mengnan Du , Ninghao Liu

Concerns about interpretability, computational resources, and principled inductive priors have motivated efforts to engineer sparse neural models for NLP tasks. If sparsity is important for NLP, might well-trained neural models naturally…

Computation and Language · Computer Science 2019-08-07 Naomi Saphra , Adam Lopez

For large language models (LLMs), sparse autoencoders (SAEs) have been shown to decompose intermediate representations that often are not interpretable directly into sparse sums of interpretable features, facilitating better control and…

Sparse Autoencoders uncover thousands of features in vision models, yet explaining these features without requiring human intervention remains an open challenge. While previous work has proposed generating correlation-based explanations…

Computer Vision and Pattern Recognition · Computer Science 2026-03-26 Javier Ferrando , Enrique Lopez-Cuena , Pablo Agustin Martin-Torres , Daniel Hinjos , Anna Arias-Duart , Dario Garcia-Gasulla

In this work, we demonstrate that affine mappings between residual streams of language models is a cheap way to effectively transfer represented features between models. We apply this technique to transfer the weights of Sparse Autoencoders…

Computation and Language · Computer Science 2025-11-04 Alan Chen , Jack Merullo , Alessandro Stolfo , Ellie Pavlick

Pathology plays an important role in disease diagnosis, treatment decision-making and drug development. Previous works on interpretability for machine learning models on pathology images have revolved around methods such as attention value…

Sparse Autoencoders (SAEs) have emerged as a powerful framework for machine learning interpretability, enabling the unsupervised decomposition of model representations into a dictionary of abstract, human-interpretable concepts. However, we…

Computer Vision and Pattern Recognition · Computer Science 2025-05-27 Thomas Fel , Ekdeep Singh Lubana , Jacob S. Prince , Matthew Kowal , Victor Boutin , Isabel Papadimitriou , Binxu Wang , Martin Wattenberg , Demba Ba , Talia Konkle

Adapting foundation models for specific purposes has become a standard approach to build machine learning systems for downstream applications. Yet, it is an open question which mechanisms take place during adaptation. Here we develop a new…

Computer Vision and Pattern Recognition · Computer Science 2025-03-24 Hyesu Lim , Jinho Choi , Jaegul Choo , Steffen Schneider

We present Universal Sparse Autoencoders (USAEs), a framework for uncovering and aligning interpretable concepts spanning multiple pretrained deep neural networks. Unlike existing concept-based interpretability methods, which focus on a…

Computer Vision and Pattern Recognition · Computer Science 2026-03-20 Harrish Thasarathan , Julian Forsyth , Thomas Fel , Matthew Kowal , Konstantinos G. Derpanis

Vision-Language-Action (VLA) models have emerged as a promising approach for general-purpose robot manipulation. However, their generalization is inconsistent: while these models can perform impressively in some settings, fine-tuned…

Robotics · Computer Science 2026-03-20 Aiden Swann , Lachlain McGranahan , Hugo Buurmeijer , Monroe Kennedy , Mac Schwager

Sparse autoencoders (SAEs) trained on large language model activations output thousands of features that enable mapping to human-interpretable concepts. The current practice for analyzing these features primarily relies on inspecting…

Computation and Language · Computer Science 2026-03-26 Wilson E. Marcílio-Jr , Danilo M. Eler

Modern large-scale Pre-trained Language Models (PLMs) have achieved tremendous success on a wide range of downstream tasks. However, most of the LM pre-training objectives only focus on text reconstruction, but have not sought to learn…

Computation and Language · Computer Science 2022-10-28 Liliang Ren , Zixuan Zhang , Han Wang , Clare R. Voss , Chengxiang Zhai , Heng Ji

The circuits framework in mechanistic interpretability aims to identify causally important sparse subgraphs of model components, typically evaluated by measuring necessity and sufficiency. We measure circuit reuse, the proportion of…

Computation and Language · Computer Science 2026-05-12 Michael Li , Nishant Subramani

Which components in transformer language models are responsible for discourse understanding? We hypothesize that sparse computational graphs, termed as discursive circuits, control how models process discourse relations. Unlike simpler…

Computation and Language · Computer Science 2025-10-14 Yisong Miao , Min-Yen Kan

Sparse Autoencoders (SAEs) have proven to be powerful tools for interpreting neural networks by decomposing hidden representations into disentangled, interpretable features via sparsity constraints. However, conventional SAEs are…

‹ Prev 1 4 5 6 7 8 10 Next ›