Deployment-Time Reliability of Learned Robot Policies
Christopher Agia

TL;DR
This paper explores deployment-time mechanisms to enhance the reliability of learned robot policies, focusing on runtime monitoring, interpretability, and success probability estimation for long-horizon tasks.
Contribution
It introduces three complementary deployment-time methods: runtime failure detection, influence-based interpretability, and success probability optimization for complex tasks.
Findings
Runtime monitoring detects failures without failure data.
Influence functions trace successes and failures to training data.
Feasibility-aware planning improves long-horizon task success.
Abstract
Recent advances in learning-based robot manipulation have produced policies with remarkable capabilities. Yet, reliability at deployment remains a fundamental barrier to real-world use, where distribution shift, compounding errors, and complex task dependencies collectively undermine system performance. This dissertation investigates how the reliability of learned robot policies can be improved at deployment time through mechanisms that operate around them. We develop three complementary classes of deployment-time mechanisms. First, we introduce runtime monitoring methods that detect impending failures by identifying inconsistencies in closed-loop policy behavior and deviations in task progress, without requiring failure data or task-specific supervision. Second, we propose a data-centric framework for policy interpretability that traces deployment-time successes and failures to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Adversarial Robustness in Machine Learning · Domain Adaptation and Few-Shot Learning
