aspireai.
PUBLIC EDITION

One world model conditioned on force, camera, hand pose and robot pose - and it beat the specialists

AspireAI community · arXiv (Bowen Xue, Zizhang Li, Hong-Xing Yu, Jiajun Wu)
Action-conditioned world models tend to be built one action type at a time, which fragments already scarce action-annotated data across separate models. UniAction represents any action as a sparse set of action elements, each with a discrete semantic identity and a continuous spatiotemporal grounding coordinate, and maps those coordinates straight into the pretrained video model's native positional space. Cardinality-calibrated attention handles the fact that different actions have different granularities. Evaluated across four action forms - force, camera control, hand pose and robot pose - UniAction beat the conditioning alternatives on action following, and the striking result is that a single jointly trained model surpassed the action-specific experts, which suggests heterogeneous action data genuinely benefit from unification rather than being split by modality. The limitation is that the abstract reports relative wins on action following without absolute numbers, so the magnitude of the gain is hard to judge from the paper's own summary.
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.