Research · Essay
The Monosemantic Shindig at the End of the Universe

on improbability drives and semanticity, both mono and poly.

The Universe, as has been observed before, is an unsettlingly big place, a fact which for the sake of a quiet life most people tend to ignore.
switch ‘universe’ with neural network and ‘big’ with opaque, and ignore no more.
shall we?
Cat V. Car

the case against the neuron included a cat and a car. neuron 4e:55 in InceptionV1 fired on cat faces, on the fronts of cars, and, for good measure, on cat legs. it became a familiar example of apparent polysemanticity, raising questions about whether individual neurons always provide the most useful units of analysis. a relatively fair reading of the evidence at the time, but notice that even the prosecution needed an interpretation of what it was looking at. somebody had to decide that cat faces and car fronts have nothing in common. the authors of Zoom In explicitly described the responses as lacking a shared basis: the neuron “isn’t responding to some commonality of cars and cat faces.”
six years later one of the people who wrote that sentence has gone back and reread the exhibit, and there are now public tools that let anyone propose a circuit in a language model and try to break it. so this is a piece about one question: when you understand a component, how much does that help you find the machinery around it?
some vocabulary first, quickly. a monosemantic unit admits one coherent reading across the cases you’ve looked at. a polysemantic unit looks like it’s mixing unrelated things. superposition is the standard story for why that would happen: a network wants to represent more feature directions than it has dimensions, so it packs them in at angles and accepts some interference. one particular caution the field learned slowly: a feature being spread across several neurons doesn’t, on its own, prove that kind of packing is going on, it can just mean the feature is distributed.
Nick Cammarata now says the cat/car neuron is a V-shape detector. pointed things: flames, fox faces, the fronts of vans, with round things pushing it the other way. that knocks a hole in one influential reading of one famous neuron. it doesn’t touch the controlled demonstrations in Toy Models of Superposition, and it isn’t meant to; rereading one exhibit can’t tell you how much superposition explains elsewhere. he has a broader hypothesis to go with it, which he calls recursive generalization: a neuron learns one pattern and grows outward into related cases over training, sometimes far enough that no single familiar word covers what it does anymore. one example connects responses to “iy”, “diy”, and “do it yourself”, which contains no “iy”; he interprets that relationship through recursive generalization. Cammarata also describes a neuron that automated interpretability had labeled a polysemantic comma detector, which he reinterprets as responding to Colorado-related content; he reports that steering it produced hiking-related responses.
what the reread can’t do, an audit can, and he offers one, with the word preliminary attached. in Qwen3-32B, treating the positive and negative side of each neuron separately (he calls these poles), his team estimates that roughly 90% have one dominant job. he’s upfront that the number moves depending on how you threshold weak activations and what you’re willing to call one thing.
separately, he reports that an agent given nothing but a neuron’s written explanation can produce inputs that make it fire hard, and the cat and the car are an illustration. these broader results are the claims to engage with, and if the audit holds up it’s good news of the plainest kind: a lot of the network’s own parts may be legible without first swapping them for a learned dictionary. a note about what 90% is a percentage of. it’s a count of legible parts, and not a measure of how much of the model’s computation anyone understands. whether clean parts add up to understanding is a different measurement, and most of this piece is about it.
the dictionary approach deserves its own paragraph, because it was essentially the field’s main bet for two years. a sparse autoencoder learns to rebuild a layer’s activations out of a large dictionary in which only a few entries are active at a time. Towards Monosemanticity trained one on a small, one-layer model and got features that were much more interpretable than the model’s own neurons. the promise was that a different decomposition would expose structure the neurons hid.
then people tested the favourite tool against boring baselines and published what they found. Google DeepMind, 2025: probes built on SAE features did worse than ordinary linear probes at detecting harmful intent, and the test that was of importance was out of distribution, on jailbreaks the probes hadn’t seen. those results and others like them led the team to deprioritize fundamental SAE work, while keeping SAEs around as a tool. Kantamneni, Engels and colleagues found the same thing from a different angle: across 113 probing datasets and every hard regime they could construct, no consistent edge over strong non-SAE baselines.
then in february 2026, Korznikov and colleagues tested how trained SAEs compared with constrained-random baselines. they built dictionaries with selected components fixed at, or held near, random initialization, and found several baselines competitive with fully trained SAEs on the interpretability, probing and causal-editing metrics tested, with results varying by configuration. on synthetic data with unequal feature frequencies, BatchTopK and JumpReLU recovered about 9% and 7% of the known features while explaining 71% of the variance. architecture mattered (TopK got 43% there, and nearly everything when frequencies were equal), but the headline stands: reconstruction quality and the familiar scores don’t certify that you’ve found the real features.
none of this is a funeral, though. these are results from inside the field, produced by the people who built the tools, and Korznikov’s random baselines are now a check anyone can run on the next SAE. even DeepMind’s positive finding is instructive: SAE features exposed spurious correlations in the team’s own dataset, which they then fixed. so, the interpretable part of the tool did interpretable work. Cammarata reports a different problem in the cat/car case: an SAE split the shared V into a cat feature and a car feature. that’s the opposite of what a dictionary is for, but still, none of this retires dictionary learning. the attribution graphs behind the Dallas result below are built on a cross-layer transcoder, a cousin of the SAE, and since 29 May 2025 Anthropic’s circuit-tracing tools have been open for supported open-weight models, with a graph explorer on Neuronpedia.
the native neurons deserve a serious comparison too, and now they’ve had one. on subject-verb agreement tasks, Arora, Wu and colleagues find neuron-based circuits as compact and faithful as SAE circuits, given a decent attribution method. on the city-to-state-to-capital task from the Biology paper, they find small sets of neurons in Llama 3.1 that encode the intermediate steps and can be steered to change the answer. so that’s two approaches, with the same computational pattern. so the burden is comparative. if you want a learned dictionary, show that it improves prediction or discovery over the relevant native-neuron and randomized baselines. a more readable dictionary isn’t, by itself, a better explanation.
a more readable dictionary isn’t, by itself, a better explanation.
descriptions of native neurons deserve the same scrutiny, since recognizing the inputs that activate a component still leaves its role in the model to be tested. an investigator can use the description to predict the effect of changing that activation, then check the prediction against what the model does.
how much does understanding the part help you understand the whole, and how do we get more cases like that?
Jump! / Floor is Lava! / Spider!

put Alice, Bob and Charlie in a soundproof glass box, where Alice says something and the other two jump. she might have told them to jump, announced that the floor was lava, or warned them about a spider. watching the exchange repeatedly could establish a reliable association between her speaking and their response, while leaving what she said unresolved. distinguishing those explanations requires specifying conditions under which they predict different behavior, then checking which prediction holds. with access to a neural network’s internal states, researchers can investigate what happens between the input and the response. an explanation of an activation’s role can be tested by changing its value and checking whether the subsequent computation behaves as predicted.
causal scrubbing formalizes one approach: the hypothesis specifies which substitutions should preserve the behavior, and activations are replaced with values taken from other inputs under those constraints. researchers then examine whether the behavior survives the changes their account predicts it should tolerate.
the measurement itself sometimes needs closer examination. in a SwiGLU unit, the intermediate activation is the product of a value and an effective gate. a gate of 0.2 multiplied by a value of 2 produces 0.4, as does a gate of −0.2 multiplied by a value of −2. recording only the product combines cases with different sign patterns. Cammarata reports that examining those patterns separately makes some previously unclear activation responses easier to interpret. Leo Gao proposes evaluating a neuron’s explanation by using it to predict activations, substituting those predictions into the model, and measuring the resulting change in its output distribution through KL divergence. this tests whether the explanation preserves information that affects subsequent computation. a description might correctly identify the kinds of inputs associated with a neuron while overlooking differences in activation strength that change the model’s predictions.
Cammarata separately reports that many weak activations in the vision models he examines can be removed with little performance loss. Gao’s proposed test addresses a related question through a different intervention: how much of a language model’s behavior is preserved when an explanation supplies the replacement activations? the result would show how much output-relevant detail that explanation captures, rather than assuming that the simplifications tolerated by the vision models will also work elsewhere.
these methods give mechanistic interpretability a way to develop explanations that other investigators can test and extend. a proposed component role can guide an intervention, and agreement with the predicted effect gives researchers evidence to use in the next investigation. as connected components are examined, their roles can constrain one another, making more specific hypotheses possible. the prospect is an expanding body of explanations that helps researchers investigate increasingly connected portions of the computation. measuring how much those explanations improve subsequent discovery would establish the practical value of that accumulated understanding.
On the Monomobile

call a model whose components each have a reliable interpretation a Monomobile. even with those descriptions available, an investigator still has to establish how the components work together. imagine two idealized detectors, red and round, each returning 1 or 0. a downstream unit that fires when their sum reaches 2 is computing red AND round. a threshold of 1 gives you red OR round. identical part descriptions; different machine.
how do you tell which you’ve got? take a red, round example, zero the red detector, hold round at one. AND says the output goes off. OR says it stays on. the part descriptions won’t tell you the rule. they will tell you which intervention settles it. in the toy you could also just read the threshold. in a large network the arithmetic is sitting right there too, and the hard part is finding a tractable account of the piece of it that matters.
The story of interpretability, as I see it, has largely been one of finding out that what was under the microscope was better than we thought.
On the Biology of a Large Language Model is what this looks like at scale. the prompt asks for the capital of the state containing Dallas. an interpretable approximation of the model suggests an intermediate representation of Texas. go back to the real model, suppress the Texas features, turn on California features, and the answer becomes Sacramento. the authors measure the intermediate effects and run analogous swaps for other places, so the account gets tested on several of its own predictions rather than one. the same paper found representations of candidate rhyme words before the model began writing a line of verse. when researchers changed those representations, the wording leading up to the rhyme changed too, supporting their interpretation that the model was composing the line around an ending it had already begun to prepare.
the practical case has examples too. in Marks and colleagues’ blind auditing game, three of four teams found a planted hidden objective. two of them got there using SAE features to locate the revealing training documents; the third used behavioural attacks and training-data search. the team with API access only, and no training data, failed. that doesn’t isolate what interpretability contributed, but it documents SAE-guided discovery: a feature pointed people at evidence they didn’t yet know to look for. this is where legibility starts to pay beyond the component you described. Cammarata’s crossword analogy: understanding neighbouring mechanisms constrains each of them, so a partial explanation suggests a better experiment, whose result sharpens the explanations around it. how much sooner could an investigator find the next mechanism with those explanations in hand, compared with someone working without them?
so here’s the test. randomly assign investigators to receive component descriptions or to work without them, with the same model access and tools, on the same budget. validate the descriptions beforehand on separate data by activation prediction, with Gao’s substitution check if you want to be strict. then both groups predict the original model’s responses to the same withheld inputs and interventions, committing before they see outcomes, and you compare accuracy and time. the descriptions have to help with consequences other than the ones used to select them, or you’ve only measured the selection. the same frame handles the comparisons people actually argue about. category-list explanations against shared-pattern explanations: “cat faces and car fronts” versus “V-shaped contours,” provided both predict activations about equally well on independent data. SAE dictionaries against native-neuron descriptions, same rules. matching a score doesn’t match all the information in an explanation, so this measures usefulness and leaves monosemanticity itself unisolated. that’s fine. usefulness is the thing.
decide the smallest gain worth caring about before you run it. if a sufficiently precise result rules that gain out, the descriptions failed. and allow for the effect being negative. a label can anchor an investigator to categories they ought to be questioning; Cammarata’s proposed V-shape interpretation suggests that, in the cat-and-car case, the original labels may have obscured a shared pattern. there’s precedent for judging interpretations by task performance, and a first version could use agents rather than people. AuditBench put auditing tools in the hands of investigator agents and found that tools which score well alone don’t reliably turn into successful investigations, and that scaffolded black-box tools performed best overall in the investigator setup tested. interpretability has to beat that in an investigator’s hands. that’s why the investigator belongs inside the evaluation. if the advantage grows as more components are understood, the field has what every science wants, which is findings that make the next finding cheaper.
repeat it with fresh cases as the map fills in, recording the effort needed to produce and validate the descriptions alongside the time investigators save by using them. follow that comparison across subsequent investigations, since an explanation that takes considerable work to establish may help researchers repeatedly once it is available.
one more constraint, because legibility does in fact have a price. in Weight-sparse transformers have interpretable circuits, Gao and colleagues force most weights to zero and recover compact, understandable circuits for selected programming tasks. legibility by design works on those tasks. scaling it into something you’d deploy is the next problem, and their own systems analysis names the stubborn part: irregular sparse connections fit badly with hardware built for regular matrix operations, and routing costs can persist even on specialized chips.
there’s also a hardware discussion to be had. its opportunity here is to make interpretable designs practical, and running the same model on a different chip changes nothing about its computation. judge any claimed improvement at matched capability, with the actual compute bill attached. sparse weights alone don’t buy monosemanticity, and if a legible architecture is too expensive to ship, it can still serve as an audit model, provided its explanations transfer; Gao and colleagues’ bridges between sparse and dense models are an early look at that route. researchers would still need to test whether the explanation they developed using the interpretable model also holds for the model they are trying to understand.
so: monosemanticity can matter before we have a complete account of a network. a useful part description helps you pick the experiment that separates competing explanations, and the result improves your understanding of the machinery next door. the field already has examples of this, and the test above asks whether the gains compound. meanwhile the old exhibits are being reread and the tools are being run against baselines. interventions are telling apart mechanisms that produce identical outputs. six years since Zoom In. a good six years.
reliable mechanistic understanding might still be a shindig at the end of the universe, but the research that is being done is invaluable and the conclusions that are being drawn are what one can only call breakthroughs in understanding machines. how soon till we understand neural networks thoroughly and whether we’ve got an improbability drive to get to that monosemantic shindig depends on how much further each discovery lets the next one travel.
the drive is at least humming.
References
- Olah, Cammarata, and colleagues. Zoom In: An Introduction to Circuits. 2020.
- Cammarata. Neural Networks Are Already Clean. 2026.
- Elhage and colleagues. Toy Models of Superposition. 2022.
- Bricken and colleagues. Towards Monosemanticity: Decomposing Language Models With Dictionary Learning. 2023.
- Smith, Rajamanoharan, and colleagues. Negative Results for Sparse Autoencoders On Downstream Tasks and Deprioritising SAE Research. 2025.
- Kantamneni, Engels, and colleagues. Are Sparse Autoencoders Useful? A Case Study in Sparse Probing. 2025.
- Korznikov and colleagues. Sanity Checks for Sparse Autoencoders: Do SAEs Beat Random Baselines? 2026.
- Anthropic. Open-sourcing circuit tracing tools. 2025.
- Arora, Wu, and colleagues. Language Model Circuits Are Sparse in the Neuron Basis. 2026.
- Lindsey and colleagues. On the Biology of a Large Language Model. 2025.
- Chan and colleagues. Causal Scrubbing: a method for rigorously testing interpretability hypotheses. 2022.
- Shazeer. GLU Variants Improve Transformer. 2020.
- Gao. Neural networks are not already clean. 2026.
- Marks and colleagues. Auditing Language Models for Hidden Objectives. 2025.
- Doshi-Velez and Kim. Towards A Rigorous Science of Interpretable Machine Learning. 2017.
- Hase and Bansal. Evaluating Explainable AI: Which Algorithmic Explanations Help Users Predict Model Behavior? 2020.
- Sheshadri and colleagues. AuditBench: Evaluating Alignment Auditing Techniques on Models with Hidden Behaviors. 2026.
- Gao and colleagues. Weight-sparse transformers have interpretable circuits. 2025.

