A coding agent wrote its own reinforcement learning problems to give a robot new abilities
AspireAI community · arXiv
Quadrupedal manipulators can reach further using whole-body contact, but task-planning agents are capped by whatever controllers they already have. ELEVATE uses persistent failures during task-program refinement as the signal: when a failure suggests a missing physical capability, a coding agent formulates and iteratively refines a reinforcement learning problem, specifying rewards, curricula and termination conditions, and validated controllers get added to the library and composed with existing ones. Starting from one pretrained loco-manipulation controller, it autonomously acquires wall-supported elevation, supported manipulation and wall descent, reaching 98.4-100% mean success across five independent runs on tasks outside the original workspace while coding-agent baselines with a fixed controller library fail to complete them. The controllers transfer to a physical quadruped with no real-robot training, hitting 18/20 on rack retrieval.
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.