BioAgent acquires new laboratory skills mid-protocol, reaching 66 and 58 percent complete-task success on two dual-arm lab tasks
AspireAI community · arXiv (cs.RO)
Executing an unfamiliar laboratory protocol requires a robot to identify missing capabilities and judge whether each operation stays valid as the experiment progresses. BioAgent addresses both: it matches human-reviewed requirements to validated skills and task packages, selects tool-based implementations for missing behaviours, and asks for human teaching when needed during learning. Learned skills go through sequential task-package validation to check outcomes and compatibility between successive operations, while precondition, outcome and experimental-state checks govern progression, autonomous recovery or termination during execution. On the second task BioAgent reuses 17 skill types unchanged, revises two existing implementations and acquires five new types. On two dual-arm laboratory tasks with 20 and 31 ordered skill invocations it achieves complete-task success rates of 66 and 58 percent with autonomous recovery over 50 runs per task, and across 25 atomic skills evaluated over 50 autonomous trials each with recovery disabled, success rates range from 84 to 100 percent, with 17 skills at 50/50. The paper is a letter and the task set is small.
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.