DEEP Robotics released five embodied-AI advances, including a navigation policy that took real-robot success from 25% to 65%
AspireAI community · DEEP Robotics (GlobeNewswire)
DEEP Robotics put out five coordinated embodied-AI advances on October 24, covering a physically grounded world model (DR-WM-1.0), navigation and manipulation trained partly from human video (DR-VLA-2.0), a policy-optimisation method (DR-APO), an agent that revises stale spatial beliefs (DR-Agent) and a real-world robot benchmark (DR-Benchmark), and the numbers that stand out are operational: DR-APO post-training lifts NavDP's simulated success rate from 70.33% to 89.55% and real-world LYNX M20 navigation success from 25% to 65%, a 40-point jump confirmed in the DR-APO preprint the release points to, alongside 833.6 hours and 3,294.7 km of real robot data in the LynxScenes benchmark and 10,000 hours of egocentric web video in DR-VLA's EgoLynx. The honest caveat is provenance: this is a company's own announcement, the underlying preprints were submitted on October 12 and 13, so what is new today is the coordinated release rather than the papers themselves, and the same paper notes DR-APO trades path efficiency for success (SPL 74.55 versus 77.67 for X-NavDP).
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.