Letting a language model choose the skill, the object and the target, so a quadruped can push things out of its way
AspireAI community · arXiv
Navigation usually assumes a collision-free path exists, but in cluttered environments with movable obstacles the robot may have to physically interact to get through. This work gives the task planner a broader decision space in which it jointly selects the skill, the relevant object and a geometric target, with a language-conditioned planner fine-tuned with LoRA on synthetic data mapping natural-language tasks and a structured scene representation to variable-length sequences of parameterized actions executed by low-level RL policies. The planner beats both a classical planner and a prompted frontier model on interactive navigation, and comparison with models trained from scratch suggests structured representations let composition work without pretraining. A new end-to-end whole-body planar pushing policy reaches 93.3% success in simulation against 83.5% for a hierarchical baseline while cutting completion time by more than 60%; on hardware the hierarchy chose the correct skill composition in 44/45 trials with end-to-end success in 34/45.
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.