aspireai.
PUBLIC EDITION

A rover that spends its few real-world tries on the terrain where its model is actually wrong

AspireAI community · arXiv
Planetary rovers will cross steep deformable terrain where slip, sinkage and deformation threaten mobility, and simulation misses some of that behaviour, creating sim-to-real gaps that normally need deployment-time adaptation, while rover operations leave no room for extensive trial and error. TERRA trains a loss predictor to estimate where future performance-relevant errors are likely to appear, then uses that signal to guide exploration during model-predictive control, while adapting a simulation-trained world model with a reward-weighted prediction loss. In simulation it reaches roughly 90% slope-climbing success within five trials under severe out-of-distribution pretraining, beating exploration baselines on reward, completion time and energy to first success. On the ERNEST rover it recovers coordinated active-suspension locomotion on a deformable Mars-simulant slope within three to five real-world trials. From CoRL 2026.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.