Near Optimal Policy Optimization via REPS

Abstract

Since its introduction a decade ago, \emph{relative entropy policy search} (REPS) has demonstrated successful policy learning on a number of simulated and real-world robotic domains, not to mention providing algorithmic components used by many recently proposed reinforcement learning (RL) algorithms. While REPS is commonly known in the community, there exist no guarantees on its performance when using stochastic and gradient-based solvers. In this paper we aim to fill this gap by providing guarantees and convergence rates for the sub-optimality of a policy learned using first-order optimization methods applied to the REPS objective. We first consider the setting in which we are given access to exact gradients and demonstrate how near-optimality of the objective translates to near-optimality of the policy. We then consider the practical setting of stochastic gradients, and introduce a technique that uses \emph{generative} access to the underlying Markov decision process to compute parameter updates that maintain favorable convergence to the optimal regularized policy.

8 main pages, 37 total pages

References in corpus (6)

• A unified view of entropy-regularized Markov decision processes
• AlgaeDICE: Policy Gradient from Arbitrary Experience
• Stochastic Primal-Dual Methods and Sample Complexity of Reinforcement Learning
• Primal-Dual $\pi$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems
• Reinforcement Learning via Fenchel-Rockafellar Duality
• Efficiently Solving MDPs with Stochastic Mirror Descent