MEGA Hub

Probabilistic Reachable-Action Verification of Visuomotor Policies via Set-Based Training

Authors

Do you know Yanliang Huang?You can claim authorship or link another user.Do you know Zhuocheng Zhang?You can claim authorship or link another user.Do you know Peng Xie?You can claim authorship or link another user.Do you know Zhen Zhang?You can claim authorship or link another user.Do you know Wenyuan Wu?You can claim authorship or link another user.Do you know Majid Khadiv?You can claim authorship or link another user.Do you know Zhuoqi Zeng?You can claim authorship or link another user.Do you know Amr Alanwar?You can claim authorship or link another user.

Abstract

Reachability analysis for visuomotor policies is difficult because large visual encoders make end-to-end set propagation computationally expensive and excessively conservative. We therefore freeze the visual encoder and confine set propagation to a low-dimensional interface between it and the downstream policy, with the interface set calibrated from held-out camera-pose perturbations. Propagating this set through the policy with zonotopes yields a terminal output-enclosure width that set-based training optimizes directly. During evaluation, camera-pose perturbations are sampled from the prescribed distribution, and rollout-level split conformal calibration converts the resulting action-deviation scores into a probabilistic reachable-action radius with finite-sample coverage. In controlled manipulation experiments, set-based training reduces this radius while preserving closed-loop task capability, and matched behavior-only, observational-consistency, and pointwise-adversarial controls all leave a larger radius.

Community

00