The Linear Centroids Hypothesis: Features as Directions Learned by Local Experts
Not on the map. Why?
Abstract (arXiv)
The Linear Representation Hypothesis (LRH) identifies features of a trained deep network (DN) as linear directions in the activation spaces, i.e., output spaces of intermediate layers. This characterization decouples the input-output maps learned by a DN from the organization of feature directions in its activation spaces. We introduce the Linear Centroids Hypothesis (LCH), which instead identifies features with linear directions among a DN's centroid spaces -- where any vector denotes a centroid or summary of a local affine expert characterizing the learned input-output maps of the DN exactly (e.g., for piecewise-affine DNs) or approximately (e.g., for smooth DNs like transformers). We show that replacing intermediate activations with centroids yields a functional drop-in alternative for standard interpretability tools. Empirically, this change yields sparser, more downstream-useful feature dictionaries on DINO ViTs, suppresses spurious directions on a controlled task, recovers interpretable circuits in GPT2-Large, and produces faithful gradient-based saliency maps. LCH unifies dictionaries, probing, circuits, and saliency maps into a single geometric object grounded in the network's input-output map -- making interpretability mechanistic by construction rather than post hoc. Code to study the LCH https://github.com/ThomasWalker1/LinearCentroidsHypothesis .
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 41 of its 55 references that are in the map. First posted on arXiv 13 Apr 2026.
Builds on
41 of 55 references.
References · 41
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,974
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,733
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2022A ConvNet for the 2020scited by 3,579
- 2016Gaussian Error Linear Units (GELUs)cited by 3,502
- 2017Axiomatic Attribution for Deep Networkscited by 3,384
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
- 2013Describing Textures in the Wildcited by 2,125
29 more
- 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,984
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
- 2017Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)cited by 1,319
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,165
- 2018Sanity Checks for Saliency Mapscited by 1,156
- 2017SmoothGrad: removing noise by adding noisecited by 1,109
- 2022Toy Models of Superpositioncited by 971
- 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 716
- 2023The Geometry of Truth: Emergent Linear Structure in Large Language Model Representations of True/False Datasetscited by 712
- 2020RobustBench: a standardized adversarial robustness benchmarkcited by 661
- 2024Scaling and evaluating sparse autoencoderscited by 553
- 2014On the Number of Linear Regions of Deep Neural Networkscited by 381
- 2023Emergent Linear Representations in World Models of Self-Supervised Sequence Modelscited by 319
- 2023Localizing Model Behavior with Path Patchingcited by 195
- 2020fastai: A Layered API for Deep Learningcited by 183
- 2025Open Problems in Mechanistic Interpretabilitycited by 179
- 2019Complexity of Linear Regions in Deep Networkscited by 167
- 2023A Comprehensive Study on Robustness of Image Classification Models: Benchmarking and Rethinkingcited by 85
- 2025Projecting Assumptions: The Duality Between Sparse Autoencoders and Concept Geometrycited by 61
- 2018Mad Max: Affine Spline Insights into Deep Learningcited by 55
- 2019The Geometry of Deep Networks: Power Diagram Subdivisioncited by 53
- 2024Deep Networks Always Grok and Here is Whycited by 51
- 2023SplineCam: Exact Visualization and Characterization of Deep Network Geometry and Decision Boundariescited by 31
- 2024Mechanistic Permutability: Match Features Across Layerscited by 22
- 2018From Hard to Soft: Understanding Deep Network Nonlinearities via Vector Quantization and Statistical Inferencecited by 13
- 2024Explaining Explainability: Recommendations for Effective Use of Concept Activation Vectorscited by 13
- 2023Characterizing Large Language Model Geometry Helps Solve Toxicity Detection and Generationcited by 12
- 2024Characterizing Model Robustness via Natural Input Gradientscited by 6
- 2024Reasoning in Large Language Models: A Geometric Perspectivecited by 4
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Gradient-Direction Sensitivity Reveals Linear-Centroid Coupling Hidden by Optimizer Trajectoriescited by 1
- 2026When Do Attention Circuits Form? Developmental Trajectories of Capability and Attention-Sink Emergence Across Three 1B-ClassArchitecturescited by 1
- 2026Behavioral Monitoring of JEPA World Models with Jacobian Centroidscited by 0
- 2026Behavioral Monitoring of JEPA World Models with Jacobian Centroids27 Sep 2026
- 2026When Do Attention Circuits Form? Developmental Trajectories of Capability and Attention-Sink Emergence Across Three 1B-ClassArchitectures1 Jun 2026
- 2026Gradient-Direction Sensitivity Reveals Linear-Centroid Coupling Hidden by Optimizer Trajectories28 Apr 2026