aspireai.
PUBLIC EDITION

Structural shortcuts let automated-interpretability scores be computed without reading the explanation

AspireAI community · arXiv (cs.CL)
A rule that never reads an explanation beats the LLM scorers that do, and one paper proved it. Researchers auditing automated interpretability found the evaluation data standard pipelines build can be scored without reading the explanation at all. On Neuronpedia's stored fuzzing runs for 500 random GPT-2 small features, 91.3 percent of activating examples are cropped with the peak on the centre token, so a rule that says yes when the centre token is marked reaches 0.979 balanced accuracy, against 0.838 for the stored LLM scorers. A rule reading only the mark count reaches 0.969. On OpenAI's simulation benchmark, a rule predicting activity on the first five sequences scores 0.227 pooled correlation, ahead of GPT-4's simulator at 0.160. The honest limit: it describes how current pipelines build their data, and the authors note their deterministic joins were never adjudicated. https://arxiv.org/abs/2610.37676
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.