Autonomous Assessment of Demonstration Sufficiency via Bayesian Inverse Reinforcement Learning
Tu Trinh, Haoyu Chen, Daniel S. Brown

TL;DR
This paper introduces a Bayesian inverse reinforcement learning method for robots to self-assess demonstration sufficiency, enabling efficient learning and active demonstration requests to achieve desired performance levels.
Contribution
It presents a novel self-assessment framework using Bayesian IRL and value-at-risk, with high-confidence bounds for demonstration sufficiency in robot learning.
Findings
Robots can accurately evaluate if they have enough demonstrations.
Active learning reduces the number of demonstrations needed.
The approach achieves desired performance levels without perfect demonstrations.
Abstract
We examine the problem of determining demonstration sufficiency: how can a robot self-assess whether it has received enough demonstrations from an expert to ensure a desired level of performance? To address this problem, we propose a novel self-assessment approach based on Bayesian inverse reinforcement learning and value-at-risk, enabling learning-from-demonstration ("LfD") robots to compute high-confidence bounds on their performance and use these bounds to determine when they have a sufficient number of demonstrations. We propose and evaluate two definitions of sufficiency: (1) normalized expected value difference, which measures regret with respect to the human's unobserved reward function, and (2) percent improvement over a baseline policy. We demonstrate how to formulate high-confidence bounds on both of these metrics. We evaluate our approach in simulation for both discrete and…
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.
