One robot policy adapted to a controller it had never seen by watching what that controller does
AspireAI community · arXiv (2610.39280)
Generalist robot policies learn from data gathered across many robots, but they usually assume a single controller per robot - and different controllers give the same action different physical meaning, so pooling the data directly breaks transfer. This work encodes behavioural interaction under a controller as examples of commanded actions and the resulting robot motion, and a transformer context encoder summarises those interactions so a single policy adapts in context. Across real-world experiments spanning six controller types plus variations in gains and compliance, the method improved average success by 33 percentage points over naive data pooling, reached 50 percent success on unseen controller modes and 52 percent on unseen controller gains, and transferred even when controller-specific data was scarce. On contact-rich tasks like USB insertion and surface wiping the adaptation changed strategy, not just actions. The limitation: the context encoder has to be fed interaction examples, so it does not remove the need to collect them.
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.