English
Related papers

Related papers: WriteSAE: Sparse Autoencoders for Recurrent State

200 papers

Understanding the internal representations of large language models is crucial for ensuring their reliability and safety, with sparse autoencoders (SAEs) emerging as a promising interpretability approach. However, current SAE training…

Machine Learning · Computer Science 2025-10-13 T. Ed Li , Junyu Ren

Sparse autoencoders (SAEs) are widely used in mechanistic interpretability to project LLM activations onto sparse latent spaces. However, sparsity alone is an imperfect proxy for interpretability, and current training objectives often…

Machine Learning · Computer Science 2026-04-09 Vivek Narayanaswamy , Kowshik Thopalli , Bhavya Kailkhura , Wesam Sakla

Sparse autoencoders (SAEs) are a promising unsupervised approach for identifying causally relevant and interpretable linear features in a language model's (LM) activations. To be useful for downstream tasks, SAEs need to decompose LM…

Machine Learning · Computer Science 2024-08-02 Senthooran Rajamanoharan , Tom Lieberum , Nicolas Sonnerat , Arthur Conmy , Vikrant Varma , János Kramár , Neel Nanda

Vision foundation models (FMs) achieve state-of-the-art performance in medical imaging. However, they encode information in abstract latent representations that clinicians cannot interrogate or verify. The goal of this study is to…

Computer Vision and Pattern Recognition · Computer Science 2026-03-26 Philipp Wesp , Robbie Holland , Vasiliki Sideri-Lampretsa , Sergios Gatidis

Sparse autoencoders (SAEs) promise a unified approach for mechanistic interpretability, concept discovery, and model steering in LLMs and LVLMs. However, realizing this potential requires learned features to be both interpretable and…

Machine Learning · Computer Science 2026-04-01 Akshay Kulkarni , Tsui-Wei Weng , Vivek Narayanaswamy , Shusen Liu , Wesam A. Sakla , Kowshik Thopalli

Sparse Autoencoders (SAEs) are widely used to steer large language models (LLMs), based on the assumption that their interpretable features naturally enable effective model behavior steering. Yet, a fundamental question remains unanswered:…

Machine Learning · Computer Science 2025-10-07 Xu Wang , Yan Hu , Benyou Wang , Difan Zou

Sparse autoencoders (SAEs) have recently become central tools for interpretability, leveraging dictionary learning principles to extract sparse, interpretable features from neural representations whose underlying structure is typically…

Machine Learning · Computer Science 2025-11-05 Valérie Costa , Thomas Fel , Ekdeep Singh Lubana , Bahareh Tolooshams , Demba Ba

Modern sequence modeling is dominated by two families: Transformers, whose self-attention can access arbitrary elements of the visible sequence, and structured state-space models, which propagate information through an explicit recurrent…

Machine Learning · Computer Science 2026-04-22 Liubomyr Horbatko

Linear Recurrent Neural Networks (linear RNNs) have emerged as competitive alternatives to Transformers for sequence modeling, offering efficient training and linear-time inference. However, existing architectures face a fundamental…

Machine Learning · Computer Science 2025-10-24 Julien Siems , Timur Carstensen , Arber Zela , Frank Hutter , Massimiliano Pontil , Riccardo Grazzi

Sparse Auto-Encoders (SAEs) are commonly employed in mechanistic interpretability to decompose the residual stream into monosemantic SAE latents. Recent work demonstrates that perturbing a model's activations at an early layer results in a…

Machine Learning · Computer Science 2024-11-19 Giorgi Giglemiani , Nora Petrova , Chatrik Singh Mangat , Jett Janiak , Stefan Heimersheim

Generative autoencoders offer a promising approach for controllable text generation by leveraging their latent sentence representations. However, current models struggle to maintain coherent latent spaces required to perform meaningful text…

Machine Learning · Computer Science 2020-07-08 Tianxiao Shen , Jonas Mueller , Regina Barzilay , Tommi Jaakkola

Sparse autoencoders (SAEs) operationalise the linear representation hypothesis: they reconstruct model activations as sparse linear combinations of interpretable dictionary atoms, on the implicit assumption that activation space is well…

Machine Learning · Computer Science 2026-05-12 Eslam Zaher , Maciej Trzaskowski , Quan Nguyen , Fred Roosta

A key barrier to interpreting large language models is polysemanticity, where neurons activate for multiple unrelated concepts. Sparse autoencoders (SAEs) have been proposed to mitigate this issue by transforming dense activations into…

Machine Learning · Computer Science 2025-10-20 Moghis Fereidouni , Muhammad Umair Haider , Peizhong Ju , A. B. Siddique

While large language models provide strong compositional reasoning, existing reasoning segmentation pipelines fail to transparently connect this reasoning to visual perception. Current methods, such as latent query alignment, are end-to-end…

Computer Vision and Pattern Recognition · Computer Science 2026-05-22 Zhenyu Lu , Liupeng Li , Jinpeng Wang , Haoqian Kang , Yan Feng , Ke Chen , Yaowei Wang

Sparse dictionary learning (and, in particular, sparse autoencoders) attempts to learn a set of human-understandable concepts that can explain variation on an abstract space. A basic limitation of this approach is that it neither exploits…

Computation and Language · Computer Science 2025-06-03 Mark Muchane , Sean Richardson , Kiho Park , Victor Veitch

While sparse autoencoders (SAEs) successfully extract interpretable features from language models, applying them to audio generation faces unique challenges: audio's dense nature requires compression that obscures semantic meaning, and…

Machine Learning · Computer Science 2025-10-31 Nathan Paek , Yongyi Zang , Qihui Yang , Randal Leistikow

Sparse Autoencoders (SAEs) have been successfully used to probe Large Language Models (LLMs) and extract interpretable concepts from their internal representations. These concepts are linear combinations of neuron activations that…

Computation and Language · Computer Science 2026-02-23 Mathis Le Bail , Jérémie Dentan , Davide Buscaldi , Sonia Vanier

Token-free language models learn directly from raw bytes and remove the inductive bias of subword tokenization. Operating on bytes, however, results in significantly longer sequences. In this setting, standard autoregressive Transformers…

Computation and Language · Computer Science 2024-08-13 Junxiong Wang , Tushaar Gangavarapu , Jing Nathan Yan , Alexander M. Rush

Sparse Autoencoders (SAEs) have been proposed as an unsupervised approach to learn a decomposition of a model's latent space. This enables useful applications such as steering - influencing the output of a model towards a desired concept -…

Machine Learning · Computer Science 2025-12-23 Dana Arad , Aaron Mueller , Yonatan Belinkov

Sparse Autoencoders (SAEs) are increasingly used to interpret foundation models, but their role as an actionable intervention space remains less understood, especially in vision. We study whether sparse visual features can be used not only…

Computer Vision and Pattern Recognition · Computer Science 2026-05-28 Gerasimos Chatzoudis , Zhuowei Li , Gemma E. Moran , Hao Wang , Dimitris N. Metaxas
‹ Prev 1 4 5 6 7 8 10 Next ›