Jump to content

Polysemanticity

From Wikipedia, the free encyclopedia

Polysemanticity is a phenomenon in neural networks in which individual neurons respond to multiple unrelated concepts rather than to a single well-defined one. A polysemantic neuron might activate for legal text, DNA sequences, and Hebrew script simultaneously.[1] Because such neurons cannot be straightforwardly interpreted, polysemanticity is a central obstacle in mechanistic interpretability.[2][3]

Background

[edit]

Mechanistic interpretability often begins from the hope that internal model components correspond to human-readable concepts. In practice, many neurons in trained models activate across semantically unrelated inputs, making them difficult to analyze in isolation.[2][4] A major theoretical treatment of the phenomenon came in a 2022 paper by Nelson Elhage and colleagues at Anthropic, which argued that polysemanticity can arise from superposition and studied it in controlled toy models.[4] An article in 2026 by an OpenAI researcher argued that superposition may not be the cause, and that it may be the process of "recursive generalization" instead.[5]

Superposition hypothesis

[edit]

The dominant explanation for polysemanticity is the superposition hypothesis. Real-world data contains more distinct features than a network has neurons. A network can therefore represent more features than it has dimensions by encoding them as overlapping linear combinations across many neurons. The trade-off is that individual neurons end up responsive to multiple unrelated features that share representational directions. Elhage et al. argued that this trade-off can be loss-minimizing, increasing representational capacity at the expense of interpretability.[4][6]

Recursive generalization hypothesis

[edit]

The 2026 article Neural Networks Are Already Clean challenges the superposition hypothesis in favor of a recursive generalization hypothesis.[5] Rather than unrelated neurons being grouped together (superposition), the authors argue that recursive generalization grows branches of related concepts, resulting in seemingly unrelated terms that share a recursive tree. The example they provide is "iy" grows to "diy", which grows to "do it yourself", which does not contain "iy" at all. The authors argue that superposition may pose difficulties for interpretability, while recursive generalization may imply easier mechanistic interpretability of neural networks. A follow up article [7] demonstrated individual neurons can be effectively interpreted through ablation methods to identify strong activations. The computational function of the neurons can be described in natural language to predict neuronal firing with 95% accuracy.

An example of a natural language description of a singular neuron is on Neuron L9_E223_N10:

"Fires on the percent sign after "1" (or ".1") in 'the 1%' wealth-inequality rhetoric, as in Occupy-style talk of the top 1% controlling wealth, profits and tax breaks, writing into social-class and wealth-share readers."

— Neurons as an Interpretable Basis


Sparse autoencoders

[edit]

One approach to recovering interpretable structure from polysemantic representations is to train a sparse autoencoder on the activations of the model being studied. The autoencoder learns a larger set of directions, each of which ideally corresponds to a single concept. A 2023 Anthropic paper reported that dictionary learning could decompose a 512-neuron transformer layer into more than 4,000 such features.[1] A 2024 follow-up applied the technique to Claude 3 Sonnet and reported many interpretable features, including some that appeared safety-relevant.[8]

MIT Technology Review named mechanistic interpretability one of its ten breakthrough technologies of 2026.[9]

References

[edit]
  1. 1 2 "Towards Monosemanticity: Decomposing Language Models With Dictionary Learning".
  2. 1 2 Ranaldi, Leonardo (2025-08-02). "Survey on the Role of Mechanistic Interpretability in Generative AI". Big Data and Cognitive Computing. 9 (8): 193. doi:10.3390/bdcc9080193. hdl:20.500.11820/2d70c20a-8563-4098-9599-c0b33d6a5712.
  3. ↑ Fereidouni, Moghis; Haider, Muhammad Umair; Ju, Peizhong; Siddique, A.B. (2026). "Evaluating Sparse Autoencoders for Monosemantic Representation" (PDF). Findings of the Association for Computational Linguistics: EACL 2026. pp. 5969–5984. Retrieved 2026-04-05.
  4. 1 2 3 Elhage, Nelson; Hume, Tristan; Olsson, Catherine; Schiefer, Nicholas; Henighan, Tom; Kravec, Shauna; Hatfield-Dodds, Zac; Lasenby, Robert; Drain, Dawn; Chen, Carol; Grosse, Roger; McCandlish, Sam; Kaplan, Jared; Amodei, Dario; Wattenberg, Martin; Olah, Christopher (2022-09-21). "Toy Models of Superposition". arXiv:2209.10652 [cs.LG].
  5. 1 2 Goodfire, Nick Cammarata. "Neural Networks Are Already Clean". Goodfire. Retrieved 2026-10-19.
  6. ↑ Scherlis, Adam; Sachan, Kshitij; Jermyn, Adam S.; Benton, Joe; Shlegeris, Buck (2022-10-04). "Polysemanticity and Capacity in Neural Networks". arXiv:2210.01892 [cs.NE].
  7. ↑ Tigges, Curt; Kowal, Matthew; McGrath, Thomas; Lewis, Owen; Cammarata, Nick (2026-11-10). "Neurons as an Interpretable Basis". Goodfire. Goodfire. Retrieved 2026-11-11.
  8. ↑ "Scaling Monosemanticity: Extracting Interpretable Features from Claude 3 Sonnet".
  9. ↑ "Mechanistic interpretability: 10 Breakthrough Technologies 2026". MIT Technology Review. Retrieved 2026-04-04.