Asking Easy Questions: A User-Friendly Approach to Active Reward Learning

October 10, 2019 ยท Declared Dead ยท ๐Ÿ› Conference on Robot Learning

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Erdem Bฤฑyฤฑk, Malayandi Palan, Nicholas C. Landolfi, Dylan P. Losey, Dorsa Sadigh arXiv ID 1910.04365 Category cs.RO: Robotics Cross-listed cs.AI, cs.LG Citations 131 Venue Conference on Robot Learning Last Checked 3 months ago
Abstract
Robots can learn the right reward function by querying a human expert. Existing approaches attempt to choose questions where the robot is most uncertain about the human's response; however, they do not consider how easy it will be for the human to answer! In this paper we explore an information gain formulation for optimally selecting questions that naturally account for the human's ability to answer. Our approach identifies questions that optimize the trade-off between robot and human uncertainty, and determines when these questions become redundant or costly. Simulations and a user study show our method not only produces easy questions, but also ultimately results in faster reward learning.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Robotics

Died the same way โ€” ๐Ÿ‘ป Ghosted