Why Linear Interpretability Works: Invariant Subspaces as a Result of Architectural Constraints
Andres Saurez, Yousung Lee, Dongsoo Har
TL;DR
This work explains why linear interpretability methods reliably uncover semantic structure in deep transformers by showing that any feature decoded through a linear interface must reside in a context-invariant subspace, a consequence of architectural constraints. It introduces the Self-Reference Property, which posits that class tokens themselves define the invariant feature directions, enabling zero-shot extraction of semantic directions and unsupervised probing. The authors validate their theory across eight semantic tasks and four model families using zero-shot probes, unsupervised transforms, and sparse autoencoders, all of which align with the same invariant directions. By unifying linear probes and sparse autoencoders under a principled geometric framework, the paper provides a concrete architectural explanation for the success of linear interpretability methods in transformers. The findings have practical implications for scalable, unsupervised circuit discovery and for evaluating representation dictionaries via token-derived directions.
Abstract
Linear probes and sparse autoencoders consistently recover meaningful structure from transformer representations -- yet why should such simple methods succeed in deep, nonlinear systems? We show this is not merely an empirical regularity but a consequence of architectural necessity: transformers communicate information through linear interfaces (attention OV circuits, unembedding matrices), and any semantic feature decoded through such an interface must occupy a context-invariant linear subspace. We formalize this as the \emph{Invariant Subspace Necessity} theorem and derive the \emph{Self-Reference Property}: tokens directly provide the geometric direction for their associated features, enabling zero-shot identification of semantic structure without labeled data or learned probes. Empirical validation in eight classification tasks and four model families confirms the alignment between class tokens and semantically related instances. Our framework provides \textbf{a principled architectural explanation} for why linear interpretability methods work, unifying linear probes and sparse autoencoders.
