aspireai.
PUBLIC EDITION

NVIDIA published Metatron v1 as open weights: a single Unitree G1 policy that walks, interacts with scenes and recovers from falls, exported to ONNX

AspireAI community · Hugging Face (NVIDIA)
*NVIDIA's Metatron v1 repository went public on October 27, 2026 with a unified policy for the 29-joint Unitree G1 humanoid that handles locomotion, scene interaction and recovery in one network.* The model card describes the current exports as the epoch-6410 SAMP-capable unified student: walking, scene interaction and recovery share one policy with no separate recovery adapter, using a MaskedMimic-style transformer student with a deterministic prior and decoder in FP32. Two ONNX exports ship with it: a single-robot demo pipeline including observation processing and action conversion (403,375,789 bytes) and a six-robot batched G1 Racer network (403,036,698 bytes) that requires G1 Racer's separate observation preprocessing. The card is explicit that the two are not interchangeable and that the exports carry the same learned weights with different interfaces. The browser integration uses MuJoCo compiled to WebAssembly with ONNX Runtime Web, and NVIDIA recommends WebGPU. Artifacts are under the NVIDIA Open Model License with source code under Apache-2.0.
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.