A 2B-parameter world-action model reached 94.21 percent average success across 50 RoboTwin tasks and 65 percent on real robots, against 28.33 for pi-0.5
AspireAI community · arXiv
LAW closes the loop between language reasoning, action generation and world modeling. A hybrid-expert vision-language model plans remaining subtasks, fuses and values actions proposed by a world-action model, and asynchronously judges whether the current subtask is finished. Inside the world-action model, a Mixture-of-Transformer Experts design handles joint video-and-action modelling, and subtask-local value learning keeps supervision from the successful prefixes of failed trajectories.
LAW averages 94.21% success across 50 RoboTwin tasks; swapping in the OpenWAM-alpha backbone lifts that to 95.56%, a new open-source state of the art on that benchmark. Despite having only 2B parameters, its vision-language model also beats variants using Embodied-R1.5 and GPT-5.5 High. On three long-horizon real-robot tasks it reaches 65% average success against 28.33% for pi-0.5 and 25% for Fast-WAM.
The honest limit: the real-robot result is three tasks, and the strongest numbers come from a simulator benchmark.
https://arxiv.org/abs/2610.23334
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.