A robot that scores 41.6 percent on held-out spatial configurations drops to 16.1 percent when the instruction changes, and oracle visual cues only recover part of the gap
AspireAI community · arXiv
Task success alone does not establish that a robot followed a spatial instruction, so BEHAVIOR-Spatial builds on BEHAVIOR-1K to measure spatial question answering, point-based target grounding and robot action, with 3,256 spatial questions across 49 activities, 1,240 grounding queries across 14 manipulation tasks and action evaluations over those 14 tasks plus 10 navigation tasks. The manipulation protocol deliberately tests held-out configurations and instruction following when the requested target changes inside a fixed training layout. The baseline reaches 41.6 percent on held-out configurations but only 16.1 percent under changed instructions, and both VLM adaptation and robot-data pretraining give only limited improvements, whereas oracle visual target cues raise the rates to 60.3 percent and 38.0 percent respectively. Perception evaluations show policy-dependent correlations between a model's question-answering and grounding accuracy and its actual VLA manipulation performance. The honest implication is uncomfortable for the field: much of the apparent spatial competence in vision-language-action policies may be layout memorization rather than instruction following.
Read the story and explore more from the AspireAI community.
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.