Relative Entropy Policy Search

Policy search is a successful approach to reinforcement learning. However, policy improvements often result in the loss of information. Hence, it has been marred by premature convergence and implausible solutions. As first suggested in the context of covariant policy gradients (Bagnell and Schneider 2003), many of these problems may be addressed by constraining the information loss. In this paper, we continue this path of reasoning and suggest the Relative Entropy Policy Search (REPS) method. The resulting method differs significantly from previous policy gradient approaches and yields an exact update step. It works well on typical reinforcement learning benchmark problems.

• Type: Conference
• Year: 2010
• Where: AAAI
• Authors: Jan Peters, Katharina Mülling, Yasemin Altun
• Keywords: AAAI 2010, Intelligent Agents, Policy, Policy Gradient, Policy Search