mlsanityData to 14 Oct 2026

Weights Read and Write Features: Scalable Parameter Decomposition Grounded in Activation Space

arXiv 2609.37731 ↗First posted 29 Sep 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Activation space and parameter space provide complementary views of model computation. Activations represent information, while weights read, transform, and write that information. Yet existing interpretability methods largely study the two spaces separately, leaving the connection between represented information and parameter-level computation underexplored. We introduce Activation-Supported Parameter Decomposition (ASPD), which jointly decomposes activation and parameter spaces and grounds each learned weight component in the activation features it reads or writes. This grounding constrains otherwise non-unique parameter decompositions using the model's internal activations, while an internal reconstruction objective provides a local learning signal at the weight matrix being analyzed. Together, these properties enable scalable, interpretable, and causally editable parameter decomposition in pretrained large language models, demonstrated on Qwen-3-8B. The learned read--write components can also be composed into parameter-level mechanism circuits. We use ASPD to recover mechanisms underlying the classic IOI circuit and trace semantic transformations through model weights.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 37 of its 47 references that are in the map. First posted on arXiv 29 Sep 2026.

Builds on

37 of 47 references.

References · 37

  1. 2025Qwen3 Technical Reportcited by 8,820
  2. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  3. 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
  4. 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
  5. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,165
  6. 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 716
  7. 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 623
  8. 2024Scaling and evaluating sparse autoencoderscited by 553
  9. 2022Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Spacecited by 532
  10. 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 435
  11. 2024Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2cited by 394
  12. 2024Patchscopes: A Unifying Framework for Inspecting Hidden Representations of Language Modelscited by 235
25 more
  1. 2024Transcoders Find Interpretable LLM Feature Circuitscited by 200
  2. 2025Open Problems in Mechanistic Interpretabilitycited by 179
  3. 2024A is for Absorption: Studying Feature Splitting and Absorption in Sparse Autoencoderscited by 160
  4. 2025Learning Multi-Level Features with Matryoshka Sparse Autoencoderscited by 143
  5. 2024BatchTopK Sparse Autoencoderscited by 130
  6. 2024The Geometry of Concepts: Sparse Autoencoder Feature Structurecited by 52
  7. 2025Activation Oracles: Training and Evaluating LLMs as General-Purpose Activation Explainerscited by 52
  8. 2025Weight-sparse transformers have interpretable circuitscited by 44
  9. 2023Do Localization Methods Actually Localize Memorized Data in LLMs? A Tale of Two Benchmarkscited by 29
  10. 2024Bilinear MLPs enable weight-based mechanistic interpretabilitycited by 28
  11. 2025Interpretability in Parameter Space: Minimizing Mechanistic Description Length with Attribution-based Parameter Decompositioncited by 27
  12. 2025Steering Language Models with Weight Arithmeticcited by 20
  13. 2025ThinkEdit: Interpretable Weight Editing to Mitigate Overly Short Thinking in Reasoning Modelscited by 17
  14. 2025Stochastic Parameter Decompositioncited by 16
  15. 2025Analyze Feature Flow to Enhance Interpretation and Steering in Language Modelscited by 13
  16. 2025Precise In-Parameter Concept Erasure in Large Language Modelscited by 11
  17. 2025Towards Understanding the Nature of Attention with Low-Rank Sparse Decompositioncited by 9
  18. 2025Low-Rank Adapting Models for Sparse Autoencoderscited by 7
  19. 2025Identifying Sparsely Active Circuits Through Local Loss Landscape Decompositioncited by 5
  20. 2025Evaluating SAE interpretability without explanationscited by 5
  21. 2026Tree SAE: Learning Hierarchical Feature Structures in Sparse Autoencoderscited by 4
  22. 2023Singular Value Representation: A New Graph Perspective On Neural Networkscited by 3
  23. 2026Semantic Optimal Transport for Sparse Autoencoder Feature Matching and Circuit Compressioncited by 2
  24. 2026Targeted Recovery of Weight-Space Mechanisms From Neural Networkscited by 1
  25. 2026Sparse Weight Decomposition for Efficient Circuit Extractioncited by 1

Built on by

Not cited yet.