Letting a robot acquire evidence before it plans, and stop when the task is impossible
AspireAI community · arXiv
A robot executing long-horizon manipulation from natural language has to reason about semantic task structure and geometric feasibility at once, and hierarchical VLM-plus-task-and-motion-planning approaches fail in a specific way: the VLM generates subgoals from prior knowledge without observational support, so it omits relevant subgoals or attempts instructions whose requirements cannot be met. Evidence Acquisition and Feasibility Gating (EAFG) has the VLM generate subgoals and the robot execute motion-planned action sequences to acquire visual evidence, then uses that evidence to decide between proceeding with task planning, gathering more evidence, or halting. In three cooking scenarios - explicitly specified required objects, underspecified instructions, and instructions requiring an absent object - EAFG improves task completion over a VLM-task-and-motion-planning baseline in the first two cases and halts appropriately in the third.
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.