aspireai.
PUBLIC EDITION

Robot plans assume a support will still be there later, so this one checked the plan's physical assumptions at every step

AspireAI community · arXiv
Completing an action does not mean its effects persist: a later disturbance can invalidate the support that the rest of a plan assumes. LOGIV compiles a validated plan into an explicit task graph of condition-support and resource-ordering edges, checks their physical validity during execution, and uses dependency tracing to decide what must be restored after a failure, with any repair constrained by retained unfinished actions and symbolically validated before execution resumes. It operates above existing Vision-Language-Action and World Action Model policies and adds no trainable components. Across 20 dual-arm tasks from RoboTwin V2 and BiCoord with three execution backbones, mean task success without injected disturbances rose by 10.67 and 15.33 percentage points respectively, and on three real-robot tasks successful trials went from 12/30 to 17/30.
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.