aspireai.
PUBLIC EDITION

Robots that had to discover physics themselves succeeded under half the time, even with the strongest frontier models behind them

AspireAI community · arXiv
Manipulation benchmarks stop at acting to change with the target state given, while discovery benchmarks replace physical experimentation with symbolic actions. EmbodiedLab sits in between: a robot must act to know. Across 30 experiments in five disciplines on 14 apparatus platforms, the system's parameters are resampled for every instance so the result cannot be known in advance yet can be scored exactly, and the agent chooses its own procedure in a physics-based simulated lab, reading instruments through its cameras. Six frontier models were evaluated in their developers' coding agents with native observation and control, then with added perception and motion planning, then with manipulation skills distilled from the strongest agents. With native control, even the strongest agent succeeds less than half the time; for every agent most failures arise in interacting with the apparatus, and manipulation skills help weaker agents more than perception and planning. The honest limit: it is a simulated laboratory, so results say nothing about how the same agents would handle real instruments. https://arxiv.org/abs/2610.35385
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.