mlsanityData to 7 Oct 2026

Interpretability in Parameter Space: Minimizing Mechanistic Description Length with Attribution-based Parameter Decomposition

arXiv 2501.14926 ↗First posted 24 Jan 2025cs.LG stat.MLcited by 25

Not on the map. Why?

Abstract (arXiv)

Mechanistic interpretability aims to understand the internal mechanisms learned by neural networks. Despite recent progress toward this goal, it remains unclear how best to decompose neural network parameters into mechanistic components. We introduce Attribution-based Parameter Decomposition (APD), a method that directly decomposes a neural network's parameters into components that (i) are faithful to the parameters of the original network, (ii) require a minimal number of components to process any input, and (iii) are maximally simple. Our approach thus optimizes for a minimal length description of the network's mechanisms. We demonstrate APD's effectiveness by successfully identifying ground truth mechanisms in multiple toy experimental settings: Recovering features from superposition; separating compressed computations; and identifying cross-layer distributed representations. While challenges remain to scaling APD to non-toy models, our results suggest solutions to several open problems in mechanistic interpretability, including identifying minimal circuits in superposition, offering a conceptual foundation for 'features', and providing an architecture-agnostic framework for neural network decomposition.

Key facts. Cited by 25 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Jan 2025.

Builds on

0 of 0 references.

No references here yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 13; 2026: 12.

25 papers.

Sort:

By area:

  1. 2025Weight-sparse transformers have interpretable circuitscited by 40
  2. 2025Steering Language Models with Weight Arithmeticcited by 19
  3. 2025Dense SAE Latents Are Features, Not Bugscited by 17
  4. 2025Stochastic Parameter Decompositioncited by 14
  5. 2025Watch the Weights: Unsupervised monitoring and control of fine-tuned LLMscited by 7
  6. 2025Decomposing Representation Space into Interpretable Subspaces with Unsupervised Learningcited by 7
  7. 2025Identifying Sparsely Active Circuits Through Local Loss Landscape Decompositioncited by 5
  8. 2025Towards Interpretability Without Sacrifice: Faithful Dense Layer Decomposition with Mixture of Decoderscited by 5
  9. 2026Subliminal Learning is a LoRA Artifactcited by 4
  10. 2026Interpreting and Steering State-Space Models via Activation Subspace Bottleneckscited by 3
  11. 2025Evaluating Explanations: An Explanatory Virtues Framework for Mechanistic Interpretability -- The Strange Science Part I.iicited by 2
  12. 2025Secret mixtures of experts inside your LLMcited by 2
13 more
  1. 2026Compressed Computation is (probably) not Computation in Superpositioncited by 2
  2. 2025Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problemcited by 1
  3. 2025Decomposition of Small Transformer Modelscited by 1
  4. 2026From Mechanistic to Compositional Interpretabilitycited by 1
  5. 2026WriteSAE: Sparse Autoencoders for Recurrent Statecited by 1
  6. 2026Sparse Weight Decomposition for Efficient Circuit Extractioncited by 1
  7. 2025Distribution-Aware Feature Selection for SAEscited by 0
  8. 2026AI Engram: In Search of Memory Traces in Artificial Intelligencecited by 0
  9. 2026Individual Parameters in Weight-Sparse Transformers Appear Interpretablecited by 0
  10. 2026Compressed Computation under L4 Loss is likely Computation in Superpositioncited by 0
  11. 2026MAxBench: A Multinomial Concept Recovery Benchmarkcited by 0
  12. 2026Neural Dynamics as the Composition of Quantized Unitscited by 0
  13. 2026Weights Read and Write Features: Scalable Parameter Decomposition Grounded in Activation Spacecited by 0