Towards Understanding the Nature of Attention with Low-Rank Sparse Decomposition
On the map: Mechanistic interpretability → Circuits and mechanistic analysis
Abstract (arXiv)
We propose Low-Rank Sparse Attention (Lorsa), a sparse replacement model of Transformer attention layers to disentangle original Multi Head Self Attention (MHSA) into individually comprehensible components. Lorsa is designed to address the challenge of attention superposition to understand attention-mediated interaction between features in different token positions. We show that Lorsa heads find cleaner and finer-grained versions of previously discovered MHSA behaviors like induction heads, successor heads and attention sink behavior (i.e., heavily attending to the first token). Lorsa and Sparse Autoencoder (SAE) are both sparse dictionary learning methods applied to different Transformer components, and lead to consistent findings in many ways. For instance, we discover a comprehensive family of arithmetic-specific Lorsa heads, each corresponding to an atomic operation in Llama-3.1-8B. Automated interpretability analysis indicates that Lorsa achieves parity with SAE in interpretability while Lorsa exhibits superior circuit discovery properties, especially for features computed collectively by multiple MHSA heads. We also conduct extensive experiments on architectural design ablation, Lorsa scaling law and error analysis.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Placed in Circuits and mechanistic analysis, one of 13 directions in Mechanistic interpretability. Builds on 28 of its 43 references that are in the map. First posted on arXiv 29 Apr 2025.
Builds on
28 of 43 references.
Closest ancestors · 6
Same direction, newest first
- 2024Towards Universality: Studying Mechanistic Similarity Across Language Model Architectures9 Oct
- 2024Transcoders Find Interpretable LLM Feature Circuits17 Jun
- 2024Automatically Identifying Local and Global Circuits with Linear Computation Graphs22 May
- 2024Dictionary Learning Improves Patch-Free Circuit Discovery in Mechanistic Interpretability: A Case Study on Othello-GPT19 Feb
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretability28 Apr
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 small1 Nov
Other references · 22
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2022Toy Models of Superpositioncited by 971
- 2024Scaling and evaluating sparse autoencoderscited by 553
- 2024Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2cited by 394
- 2023Towards Best Practices of Activation Patching in Language Models: Metrics and Methodscited by 359
- 2023Finding Neurons in a Haystack: Case Studies with Sparse Probingcited by 334
- 2024Retrieval Head Mechanistically Explains Long-Context Factualitycited by 232
10 more
- 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 202
- 2024Improving Dictionary Learning with Gated Sparse Autoencoderscited by 179
- 2016Linear Algebraic Structure of Word Senses, with Applications to Polysemycited by 165
- 2024Llama Scope: Extracting Millions of Features from Llama-3.1-8B with Sparse Autoencoderscited by 143
- 2024Arithmetic Without Algorithms: Language Models Solve Math With a Bag of Heuristicscited by 97
- 2023Successor Heads: Recurring, Interpretable Attention Heads In The Wildcited by 77
- 2023Copy Suppression: Comprehensively Understanding an Attention Headcited by 76
- 2024Decomposing The Dark Matter of Sparse Autoencoderscited by 45
- 2024Interpreting Attention Layer Outputs with Sparse Autoencoderscited by 43
- 2024An X-Ray Is Worth 15 Features: Sparse Autoencoders for Interpretable Radiology Report Generationcited by 25
Built on by
Citing papers per year: 2025: 2; 2026: 7.
9 papers.
- 2025Adversarial Attacks Leverage Interference Between Features in Superpositioncited by 8
- 2025Dimensional Collapse in Transformer Attention Outputs: A Challenge for Sparse Dictionary Learningcited by 6
- 2026Tracing the Thought of a Grandmaster-level Chess-Playing Transformercited by 2
- 2026Transcoder Adapters for Reasoning-Model Diffingcited by 1
- 2026The Past Is Not Past: Memory-Enhanced Dynamic Reward Shapingcited by 1
- 2026WriteSAE: Sparse Autoencoders for Recurrent Statecited by 1
- 2026A Distributional View for Visual Mechanistic Interpretability: KL-Minimal Soft-Constraint Principlecited by 1
- 2026Targeted Recovery of Weight-Space Mechanisms From Neural Networkscited by 1
- 2026Weights Read and Write Features: Scalable Parameter Decomposition Grounded in Activation Spacecited by 0
- 2026Weights Read and Write Features: Scalable Parameter Decomposition Grounded in Activation Space29 Sep 2026
- 2026Targeted Recovery of Weight-Space Mechanisms From Neural Networks19 Jun 2026
- 2026A Distributional View for Visual Mechanistic Interpretability: KL-Minimal Soft-Constraint Principle17 May 2026
- 2026WriteSAE: Sparse Autoencoders for Recurrent State12 May 2026
- 2026The Past Is Not Past: Memory-Enhanced Dynamic Reward Shaping13 Apr 2026
- 2026Tracing the Thought of a Grandmaster-level Chess-Playing Transformer11 Apr 2026
- 2026Transcoder Adapters for Reasoning-Model Diffing24 Feb 2026
- 2025Adversarial Attacks Leverage Interference Between Features in Superposition13 Oct 2025
- 2025Dimensional Collapse in Transformer Attention Outputs: A Challenge for Sparse Dictionary Learning23 Aug 2025
Similar, not cited
Close in wording, no citation either way
- 2025Intrinsically Interpretable Attention via Sparse Post-Training
- 2023Rethinking Attention: Exploring Shallow Feed-Forward Neural Networks as an Alternative to Attention Layers in Transformers
- 2025Rethinking Transformer Connectivity: TLinFormer, A Path to Exact, Full Context-Aware Linear Attention
- 2025Optimizing Native Sparse Attention with Latent Attention and Local Global Alternating Strategies
- 2025Causal Head Gating: A Framework for Interpreting Roles of Attention Heads in Transformers
- 2026Routing Absorption in Sparse Attention: Why Random Gates Are Hard to Beat
- 2025Mixture of Sparse Attention: Content-Based Learnable Sparse Attention via Expert-Choice Routing
- 2023SEA: Sparse Linear Attention with Estimated Attention Mask