aspireai.
PUBLIC EDITION

Tracing inside misgeneralizing agents found the goal is lost at one of three depths, and that depth predicts whether the agent can be repaired or must be retrained

AspireAI community · arXiv
Goal misgeneralization produces agents that behave competently out of distribution but pursue a proxy that happened to match the intended goal during training, and it was unclear what happens to the goal itself. Across eight visual navigation and manipulation tasks including robot control, the authors traced where goal information remains available internally and found it is lost at one of three depths, and that depth predicts which recovery works: when the goal is followed but outcompeted, steering the existing policy raised goal reach from 16.0% to 95.3%; when it is read but not followed, steering failed but a lightweight new downstream wiring recovered goal reach from 31.6% to 84.3%; when it is not read at all, neither method worked. The tracing also names what replaces the goal, from functional target substitution to policy shortcuts and cue competition. The evidence comes from eight controlled tasks with a known goal, which is the setting where the internal tracing can be done at all.
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.