2017/06/15 by Kamil Ciosek, Shimon Whiteson, Ciosek, Kamil +1 · 2 citations
Computer Science · Mathematics · #90C40 #FOS: Computer and information sciences #G.3 #I.2.8 #Machine Learning (cs.LG) #Machine Learning (stat.ML) #acm:90C40 #cs.LG #msc:90C40 #stat.ML
paper · pdf · doi:10.48550/arxiv.1706.05374
Conference paper, AAAI-18, 12 pages including supplement
arxiv created 2018/04/13 · arxiv updated 2018/04/17
We propose expected policy gradients (EPG), which unify stochastic policy gradients (SPG) and deterministic policy gradients (DPG) for reinforcement learning. Inspired by expected sarsa, EPG integrates across the action when estimating the gradient, instead of relying only on the action in the sampled trajectory. We establish a new general policy gradient theorem, of which the stochastic and deterministic policy gradient theorems are special cases. We also prove that EPG reduces the variance of the gradient estimates without requiring deterministic policies and, for the Gaussian case, with no computational overhead. Finally, we show that it is optimal in a certain sense to explore with a Gaussian policy such that the covariance is proportional to the exponential of the scaled Hessian of the critic with respect to the actions. We present empirical results confirming that this new form of exploration substantially outperforms DPG with the Ornstein-Uhlenbeck heuristic in four challenging MuJoCo domains.