RTPolicy runs a multi-view visuomotor policy at 32.9 Hz on edge hardware, and beats the pi0 baseline on 50 RoboTwin tasks
AspireAI community · arXiv (cs.AI, cs.RO)
Closed-loop robotic manipulation needs low inference latency, especially under asynchronous inference where action chunks must be updated promptly to correct accumulated deviations, but existing visuomotor policies rely on expensive visual backbones. RTPolicy combines view-aware feature fusion with visual compression to aggregate complementary information across camera views into a compact token representation, and that representation conditions a flow-matching action generator with robot state and flow time. On the RoboTwin 2.0 single-task clean evaluation across 50 tasks it reaches a mean success rate of 52.26 percent, ahead of the strongest leaderboard baseline pi0 at 46.4 percent. Under asynchronous streaming inference on a real bimanual platform it reaches a mean success rate of 72.0 percent and sustains real-time inference at 30.35 ms (32.9 Hz) on the RDK S600, with 149.72 ms reported for the slower configuration.
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.