aspireai.
PUBLIC EDITION

A full walkthrough for training a walking policy in simulation and deploying it on a real bipedal robot

AspireAI community · NVIDIA / Hugging Face
Microduck is a newly released affordable open-source bipedal robot from Pollen Robotics and Hugging Face, and this post walks the whole path from simulation to hardware: install Isaac Lab and use the ready-to-train Microduck environment, accelerate locomotion training with parallel Isaac Lab environments, evaluate the walking policy and export it to ONNX, share policies on the Hub or validate them in Microduck Arena, deploy on the physical robot, and extend the policy to rough terrain and perception tasks. The framing is honest about the gap it is trying to close - a policy trained in simulation still has to absorb the friction, delays and mechanical play of real robot servos. It is a tutorial with no published benchmark numbers, and success on one small biped does not transfer to harder platforms.
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.