aspireai.
PUBLIC EDITION

Coding agents built 25 robotics simulations selected by U.S. GDP data, and every frontier model scored zero on the benchmark they made

AspireAI community · arXiv
Gym-Anything for Robotics treats simulation authoring as a coding-agent task: if agents get better at writing code, the simulated environments get richer. The pipeline picks physical work from U.S. GDP data, defines what makes a good simulation and a good task, then runs an adversarial creation-audit loop where a creation agent builds a simulation and an audit agent checks it against those definitions, repeating for three rounds. The result is RoboWorld: 25 simulations spanning manufacturing, construction, food service, laboratories and logistics, with 25 test and 175 training RL environments, each with a deterministic verifier and a continuous reward. The result worth reading is the scoreboard. GPT-6 Astra, GPT-6.1 Terra and Claude Opus 5.5 all completed zero of the 25 test tasks, with average rewards between 0.002 and 0.06, and Opus 5.5 earned no reward at all on 16 of the 25. On an easier 25-task subset Opus 5.5 reached 32 percent success. The same privileged-state access that makes the benchmark hard for evaluation turned out to be useful for training: a small VLA policy trained on the agents' demonstrations went from zero to 53 percent success.
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.