mlsanityData to 14 Oct 2026

Concept-Guided Interpretability via Neural Chunking

arXiv 2505.11576 ↗First posted 16 May 2025cs.LG cs.AI cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Neural networks are often described as black boxes, reflecting the significant challenge of understanding their internal workings and interactions. We propose a different perspective that challenges the prevailing view: rather than being inscrutable, neural networks exhibit patterns in their raw population activity that mirror regularities in the training data. We refer to this as the Reflection Hypothesis and provide evidence for this phenomenon in both simple recurrent neural networks (RNNs) and complex large language models (LLMs). Building on this insight, we propose to leverage our cognitive tendency of chunking to segment high-dimensional neural population dynamics into interpretable units that reflect underlying concepts. We propose three methods to extract recurring chunks on a neural population level, complementing each other based on label availability and neural data dimensionality. Discrete sequence chunking (DSC) learns a dictionary of entities in a lower-dimensional neural space; population averaging (PA) extracts recurring entities that correspond to known labels; and unsupervised chunk discovery (UCD) can be used when labels are absent. We demonstrate the effectiveness of these methods in extracting concept-encoding entities agnostic to model architectures. These concepts can be both concrete (words), abstract (POS tags), or structural (narrative schema). Additionally, we show that extracted chunks play a causal role in network behavior, as grafting them leads to controlled and predictable changes in the model's behavior. Our work points to a new direction for interpretability, one that harnesses both cognitive principles and the structure of naturalistic data to reveal the hidden computations of complex learning systems, gradually transforming them from black boxes into systems we can begin to understand.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 45 of its 94 references that are in the map. First posted on arXiv 16 May 2025.

Builds on

45 of 94 references.

References · 45

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
  3. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  4. 2019Similarity of Neural Network Representations Revisitedcited by 1,755
  5. 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
  6. 2023Representation Engineering: A Top-Down Approach to AI Transparencycited by 1,336
  7. 2017Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)cited by 1,319
  8. 2017Explanation in Artificial Intelligence: Insights from the Social Sciencescited by 1,206
  9. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,165
  10. 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,059
  11. 2022Toy Models of Superpositioncited by 971
  12. 2021Probing Classifiers: Promises, Shortcomings, and Advancescited by 876
33 more
  1. 2018RISE: Randomized Input Sampling for Explanation of Black-box Modelscited by 838
  2. 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
  3. 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 623
  4. 2021Knowledge Neurons in Pretrained Transformerscited by 601
  5. 2024Scaling and evaluating sparse autoencoderscited by 553
  6. 2022Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Spacecited by 532
  7. 2021Sentence-T5: Scalable Sentence Encoders from Pre-trained Text-to-Text Modelscited by 463
  8. 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 435
  9. 2016A Corpus and Evaluation Framework for Deeper Understanding of Commonsense Storiescited by 417
  10. 2024The Platonic Representation Hypothesiscited by 382
  11. 2023Finding Neurons in a Haystack: Case Studies with Sparse Probingcited by 334
  12. 2014Understanding image representations by measuring their equivariance and equivalencecited by 243
  13. 2013k-Sparse Autoencoderscited by 215
  14. 2024Not All Language Model Features Are One-Dimensionally Linearcited by 212
  15. 2021Revisiting Model Stitching to Compare Neural Representationscited by 209
  16. 2022Relative representations enable zero-shot latent space communicationcited by 191
  17. 2016Synthesizing the preferred inputs for neurons in neural networks via deep generator networkscited by 181
  18. 2020Compositional Explanations of Neuronscited by 172
  19. 2018Visual Interpretability for Deep Learning: a Surveycited by 155
  20. 2017Learning to Generate Reviews and Discovering Sentimentcited by 148
  21. 2023Future Lens: Anticipating Subsequent Tokens from a Single Hidden Statecited by 121
  22. 2023A Holistic Approach to Unifying Automatic Concept Extraction and Concept Importance Estimationcited by 109
  23. 2020On Linear Identifiability of Learned Representationscited by 105
  24. 2023Jump to Conclusions: Short-Cutting Transformers With Linear Transformationscited by 90
  25. 2025A Survey on Sparse Autoencoders: Interpreting the Internal Mechanisms of Large Language Modelscited by 76
  26. 2024Applying sparse autoencoders to unlearn knowledge in language modelscited by 59
  27. 2023Multi-dimensional concept discovery (MCD): A unifying framework with completeness guaranteescited by 50
  28. 2023Codebook Features: Sparse and Discrete Interpretability for Neural Networkscited by 48
  29. 2023Rosetta Neurons: Mining the Common Units in a Model Zoocited by 46
  30. 2024Evaluating Open-Source Sparse Autoencoders on Disentangling Factual Knowledge in GPT-2 Smallcited by 34
  31. 2022Interpreting Neural Networks through the Polytope Lenscited by 33
  32. 2024Evaluating Sparse Autoencoders on Targeted Concept Erasure Taskscited by 15
  33. 2020Word Equations: Inherently Interpretable Sparse Word Embeddingsthrough Sparse Codingcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.