Detecting Silent Action-Interface Mismatch with Calibrated Relational World Models
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2606. 08508v1 Announce Type: cross Abstract: Generative robot policies fail unpredictably at deployment: they hesitate at critical moments, drift off-task, or commit to unrecoverable actions.
arXiv:2608.29967v1 Announce Type: cross Abstract: Vision-Language-Action (VLA) models demonstrate strong semantic understanding yet exhibit systematic failures during deployment. The conditions under...
arXiv:2608.25757v4 Announce Type: replace-cross Abstract: Large-scale vision--language--action (VLA) policies have advanced generalist robot control, yet most remain stimulus-to-action black boxes: a...
VLA-FAIL introduces a lightweight framework for detecting failures in vision-language-action models used in robotic manipulation. It combines two novel detectors: the first-layer Mahalanobis distance (LLMD) identifies out-of-distribution states by comparing token-wise deviations in last-layer features to training data, while the second, action chunk consistency (ACC), detects failures by spotting inconsistencies between consecutive action chunks in receding-horizon control. The authors also propose a threshold‑independent metric, “AUCPDT,” to evaluate detection accuracy and latency, and show through real‑world and simulation experiments that LLMD and ACC together provide reliable and early failure detection, outperforming more expensive baseline methods.
arXiv:2608. 04692v1 Announce Type: cross Abstract: Task-vector arithmetic offers a closed-form way to modify a model, yet its behavioral locality remains unclear in closed-loop robot control.
IndustrialVLA-Bench evaluates six released vision‑language‑action (VLA) and world‑action (WAM) robot policy models using a unified reporting schema. It measures clean capability on LIBERO, non‑language robustness on LIBERO‑Plus, instruction sensitivity on LIBERO‑Para, and observed execution cost, aggregating results across three random seeds. The benchmark also reports inference latency, peak memory, runtime mode, and evidence status for each system, enabling traceable comparisons without claiming one paradigm is universally superior.