A world-action model ran its imagination in the background and cut control latency 24 times without losing task success
AspireAI community · arXiv (Linhan Wang, Zijian An, Mingyuan Zhang)
World-action models for robots face a bind: generating video at control rate is too slow to be usable, while dropping test-time visual imagination costs task success. GlanceWAM decouples the two on a single shared video DiT backbone, with an asynchronous proposer glancing ahead on a slow clock to imagine one lookahead frame seconds into the future while an action head decodes action chunks at control rate purely in latent space without blocking, enabled by a non-interfering attention mask and staleness-robust horizon training. Trained purely on demonstrations it reaches 72.2 percent on the 24-task RoboCasa kitchen benchmark against 67.1 percent for synchronous Cosmos Policy and 99.0 percent on LIBERO, while cutting per-chunk control latency 24 times relative to synchronous world-action models, at 48 ms on one A100. In single-arm and bimanual real-robot manipulation it beats the average success of pi-0.5 without any robot-data pretraining.
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.