An open 27B vision-language judge judged robot success at 95.2% balanced accuracy and 0.993 AUROC
AspireAI community · arXiv
Many robot manipulation videos simply do not indicate whether the task succeeded, so RoboJev-27B is an open-weight vision-language model that takes a task instruction and 10 frames of an attempt and predicts whether the robot accomplished the goal. It is a JEV-27B-VL variant with a rank-32 LoRA adapter on the language model only, trained on 52,598 episode records, using a calibrated two-token readout that emits success/failure probabilities in a single forward pass.
On 268 held-out episodes of the same SO-101 robot it attains 95.2% balanced accuracy and 0.993 AUROC, and generalises to 459 episodes from unseen labs and robots at 0.890 AUROC, with 93.3% accuracy on 135 community-collected episodes. It infers in 0.26 seconds per episode on a single H100, about $0.19 per 1,000 success predictions at $2.69 per GPU-hour.
The honest limit: on the unseen-lab subset the base model reaches 0.900 AUROC with the same inputs, so the adapter's clear win is in-domain rather than on transfer.
https://arxiv.org/abs/2610.33718
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.