Provably Efficient Learning of Transferable Rewards

Abstract
The reward function is widely accepted as a succinct, robust, and transferable representation of a task. Typical approaches, at the basis of Inverse Reinforcement Learning (IRL), leverage on expert demonstrations to recover a reward function. In this paper, we study the theoretical properties of the class of reward functions that are compatible with the expert’s behavior. We analyze how the limited knowledge of the expert’s policy and of the environment affects the reward reconstruction phase. Then, we examine how the error propagates to the learned policy’s performance when transferring the reward function to a different environment. We employ these findings to devise a provably efficient active sampling approach, aware of the need for transferring the reward function, that can be paired with a large variety of IRL algorithms. Finally, we provide numerical simulations on benchmark environments.

[Link] [Poster] [Slides] [Talk] [BibTeX]

 @incollection{metelli2021provably,
    author = "Metelli*, Alberto Maria and Ramponi*, Giorgia and Concetti, Alessandro and Restelli, Marcello",
    title = "Provably Efficient Learning of Transferable Rewards",
    booktitle = "Proceedings of the 38th International Conference on Machine Learning ({ICML})",
    volume = "139",
    pages = "7665--7676",
    publisher = "{PMLR}",
    year = "2021",
    url = "http://proceedings.mlr.press/v139/metelli21a.html"
}