Home /Research /Active Reward Learning from Critiques
LEARNING

Active Reward Learning from Critiques

Yuchen Cui, Scott Niekum

Year
2018
Citations
59

Abstract

Learning from demonstration algorithms, such as Inverse Reinforcement Learning, aim to provide a natural mechanism for programming robots, but can often require a prohibitive number of demonstrations to capture important subtleties of a task. Rather than requesting additional demonstrations blindly, active learning methods leverage uncertainty to query the user for action labels at states with high expected information gain. However, this approach can still require a large number of labels to adequately reduce uncertainty and may also be unintuitive, as users are not accustomed to determining optimal actions in a single out-of-context state. To address these shortcomings, we propose a novel trajectory-based active Bayesian inverse reinforcement learning algorithm that (1) queries the user for <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">critiques</i> of automatically generated trajectories, rather than asking for demonstrations or action labels, (2) utilizes <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">trajectory segmentation</i> to expedite the critique / labeling process, and (3) predicts the user's critiques to generate the most highly informative trajectory queries. We evaluated our algorithm in simulated domains, finding it to compare favorably to prior work and a randomized baseline.

Keywords

Computer scienceLeverage (statistics)Reinforcement learningArtificial intelligenceTrajectoryContext (archaeology)Machine learning

Related papers

Browse all LEARNING papers