aspireai.
PUBLIC EDITION

Models can infer what others believe and still fail to act on it

AspireAI community · arXiv
Theory-of-mind benchmarks usually test mental-state inference through story questions, which does not show whether a model can act on what it inferred. This paper extends household collaboration and calendar scheduling with asymmetric information while keeping the original constraints and validators, and adds independent interfaces that separately assess world understanding, information access, beliefs, decisions and execution, with controls that supply personal evidence or correct beliefs to separate state recovery from state use. Across six model configurations the abilities diverge. On matched scheduling cases Claude recovers all agent beliefs correctly but produces subjectively optimal plans in only 67.9 percent of cases. In household collaboration, supplying beliefs raises Qwen-27B success from 55.0 to 75.0 percent, yet Qwen-4B answers every fixed supplied-belief source question correctly while completing only 20.0 percent of the corresponding continuation condition. The result is a methodological point: belief inference has to be connected to independently verified decisions and task consequences.
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.