Skip to yearly menu bar Skip to main content

In-Person Poster presentation / poster accept

Performance Bounds for Model and Policy Transfer in Hidden-parameter MDPs

Haotian Fu · Jiayu Yao · Omer Gottesman · Finale Doshi-Velez · George D Konidaris

MH1-2-3-4 #99

Keywords: [ Reinforcement Learning ] [ reinforcement learning ] [ theory ] [ meta learning ] [ transfer learning ]

Abstract: In the Hidden-Parameter MDP (HiP-MDP) framework, a family of reinforcement learning tasks is generated by varying hidden parameters specifying the dynamics and reward function for each individual task. HiP-MDP is a natural model for families of tasks in which meta- and lifelong-reinforcement learning approaches can succeed. Given a learned context encoder that infers the hidden parameters from previous experience, most existing algorithms fall into two categories: $\textit{model transfer}$ and $\textit{policy transfer}$, depending on which function the hidden parameters are used to parameterize. We characterize the robustness of model and policy transfer algorithms with respect to hidden parameter estimation error. We first show that the value function of HiP-MDPs is Lipschitz continuous under certain conditions. We then derive regret bounds for both settings through the lens of Lipschitz continuity. Finally, we empirically corroborate our theoretical analysis by experimentally varying the hyper-parameters governing the Lipschitz constants of two continuous control problems; the resulting performance is consistent with our predictions.

Chat is not available.