aspireai.
PUBLIC EDITION

RoboAuto organised physical understanding across object, scene and interaction levels, and hit 89.1 percent success on short-horizon LIBERO-PRO

AspireAI community · arXiv
*Code-as-policy robot agents refine programs from execution feedback alone, which tells them what happened but rarely why.* RoboAuto adds explicit structure: a hierarchical knowledge base holding executable skills plus object-centric knowledge of affordances, spatial relations and action effects; scene grounding that ties that knowledge to the current environment; and multi-stage planning with self-designed experiments that check whether each stage produced its expected physical effect and actively test competing hypotheses. The knowledge base is learned from embodied data and from online task solving. Across five benchmark families it reaches an 89.1 percent success rate on short-horizon LIBERO-PRO tasks and more than twice the mean success rate of ASPIRE on LIBERO-PRO Long and LIBERO-Plus. It also beats ASPIRE and pi-0.5 on three challenging long-horizon real-robot tasks requiring precise manipulation, and the knowledge base transfers across simulators and embodiments. The caveat worth stating plainly: the headline 89.1 percent is on the short-horizon suite - the long-horizon and real-robot comparisons are stated as relative wins rather than absolute scores.
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.