aspireai.
PUBLIC EDITION

Using reinforcement learning to collect diverse robot demonstrations lifted downstream imitation success from 40 to 62 percent in simulation

AspireAI community · arXiv (Park, Kim, Kim, Lee, Hwang, Shin, Hyung, Lee & Choo - DAVIAN Robotics)
Collecting varied robot demonstrations by hand is slow, and repeating one solution teaches a policy one narrow way to succeed. DiscoDemo flips the role of reinforcement learning: instead of deploying it as a controller, it trains a privileged latent-conditioned generator with a reverse curriculum and a success-gated diversity objective, safety-filters the resulting rollouts and exports them as a plain dataset for a downstream visuomotor policy. Across four manipulation tasks, averaged, downstream success reached 62 percent in simulation against 40 percent for the strongest baseline and 78 percent on the real robot against 39 percent. The framing matters: the gain belongs to the imitation policy fed better data rather than to the generator, which is privileged and offline, and the authors describe it as complementary to corrective data collection rather than a replacement. The project page, GitHub repository and Hugging Face checkpoints are public.
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.