SYNTHESIS NOTE
Topics›MechInterp›this note

Do standard analysis methods hide nonlinear features in neural networks?

Current representation analysis tools like PCA and linear probing may systematically miss complex nonlinear computations while over-reporting simple linear features. This raises questions about whether our interpretability methods are actually capturing what networks compute.

Synthesis note · 2026-02-23 · sourced from MechInterp

Standard methods for analyzing neural network representations — PCA, linear regression, Representational Similarity Analysis (RSA) — produce systematically biased pictures of what a network computes. Simple (linear) features are more strongly and consistently represented than complex (highly nonlinear) features, even when both play equal computational roles in the system's behavior.

This matters because the bias is not in the network — it is in our analysis tools. A network might compute equally using simple and complex features, but our standard methods will over-report the simple ones and under-report the complex ones. The resulting picture of "what the network represents" is skewed toward the features our tools are best at detecting.

The homomorphic encryption case study is particularly striking: a system can operate on encrypted representations with no interpretable structure in its activations, yet compute perfectly meaningful functions. Representation patterns and computation can be entirely dissociated. This is an extreme case, but it demonstrates that analyzing representations is not equivalent to understanding computation.

Implications for mechanistic interpretability:

This challenges a key assumption in the RepE framework: Can high-level concepts replace circuit-level analysis in AI? relies on linear reading vectors. If important concepts are encoded nonlinearly, RepE will systematically miss them while confidently reporting the linear ones.

Inquiring lines that read this note 19

This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.

Can mechanistic interpretability methods reliably reveal what models actually know? How do neural networks learn compositional structure from training? When do simpler collaborative filtering approaches outperform complex LLM recommenders? How does diversity prevent model convergence on superficial patterns? How do sequence length and task type interact with sparsity tolerance? Why do vector embeddings fail at capturing task-relevant relationships?

Related concepts in this collection 6

This note in its neighbourhood — explore the map, then jump to a related concept in the list below.

Concept map
16 direct connections · 145 in 2-hop network ·dense cluster Open in graph ↗

Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph

your link semantically near linked from elsewhere

Related papers in this collection 8

Papers most semantically related to this note, ranked by cosine similarity in the embedding space.

Original note title

representation analysis methods are systematically biased toward simple features — computationally important complex features may be invisible