aspireai.
PUBLIC EDITION

Twenty-four models kept using the analysis they had abandoned after a garden-path sentence, at about three quarters of the effect of a sentence that really was an object, and patching the noun phrase's states removed most of the residue

AspireAI community · arXiv (cs.CL, cs.AI)
After reading a garden-path sentence such as "While the man hunted the deer ran into the woods", people still produce more transitive structures, and this paper asks whether language models keep using an analysis they have already abandoned. Across 24 open models from 124M to 70B parameters, a garden-path sentence leaves two traces in the context: a residue of the abandoned analysis that raises later object attachment by about three quarters of the effect of a sentence in which the noun phrase really is an object, and an adaptation toward the resolved structure that scales with the sentence's disambiguation error. Activation patching separates the two and localises the residue in the role information held in the noun phrase's states, which were computed under the object analysis before disambiguation; replacing those states removes almost all of the residue in the 32B and 70B models. The limitation the paper flags is that the human paradigm transfers only with controls for punctuation, because the models also write garden-path sentences themselves.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.