aspireai.
PUBLIC EDITION

A simulated benchmark for a low-cost robot arm reproduced the real robot's policy ranking exactly, but the best learned policies still only score near 61 percent

AspireAI community · arXiv (cs.CV)
Low-cost arms like the SO-101 are the usual entry point into robot learning, and the benchmark options have been thin: mostly physical hardware, simple tasks, and few held-out objects. SO-101 Bench is a simulated benchmark for language-conditioned spatial manipulation built on an Isaac Lab digital twin of a real SO-101 setup, with 4 tasks scored as 5 families, 138 objects split across seen, unseen-instance and unseen-class, 916 evaluation episodes including subsets for held-out appearances, rotate-to-fit planning and occlusion memory, and 3,629 simulated demonstrations that every learned policy is fine-tuned on under an equal compute budget. The headline is a fidelity result. Five policies trained without real data, four VLAs and an LLM agent all keep their exact ranking when the same weights run on the physical arm in an unseen environment with unseen objects - Spearman rho of 1.00 and mean maximum rank variation of 0.000 - although the authors state plainly that simulation overestimates success. Across nine VLAs and world-action models, the best learned policies score near 61 percent, and spatial placement, unseen object classes and rotate-to-fit planning remain open. One result deserves separate attention: an LLM agent that writes code and hands grasping off to a learned policy scores 83.2 percent, and an ablation attributes that lead to the choice of harness and the choice of language model rather than to learned grasp ability. The caveat is scope - one arm platform, one simulated scene family, and physical validation of a small policy set in a single unseen environment.
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.