aspireai.
PUBLIC EDITION

Two thirds of wrong patches trace back to a faulty claim in the agent's own chain of thought, and fixing that one claim fixed the defect 89 percent of the time

AspireAI community · arXiv
The first empirical study of task-grounded reasoning analyzed 400 trajectories from four open-weight reasoning models on SWE-bench Pro, extracting atomic claims from each chain of thought and checking them against evidence gathered by a separate agent. The checkable claims occupy only 18.5 percent of CoT tokens but average 191 per trajectory, and at least 9.6 percent of them are faulty. Faulty claims show up in 96.7 percent of successfully resolved trajectories, so their presence alone barely predicts failure. Yet two thirds of the 188 incorrect patches trace back to a faulty claim, and correcting that single claim makes the agent fix the linked defect in 89.0 percent of cases. Correcting every faulty claim resolves 11.7 percent of failed tasks, so the technique is a diagnostic and repair lever rather than a complete fix. Each causal link was confirmed with a claim-corrected replay.
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.