Stochastic Neural Networks for Hierarchical Reinforcement Learning
Carlos Florensa†, Yan Duan‡†{{}^{\dagger}}{{}^{\ddagger}}, Pieter Abbeel§†‡{{}^{\dagger}}{{}^{\ddagger}}{{}^{\mathsection}} † UC Berkeley, Department of Electrical Engineering and Computer Science § International Computer Science Institute ‡ OpenAI
Abstract
Deep reinforcement learning has achieved many impressive results in recent years. However, tasks with sparse rewards or long horizons continue to pose significant challenges. To tackle these important problems, we propose a general framework that first learns useful skills in a pre-training environment, and then leverages the acquired skills for learning faster in downstream tasks. Our approach brings together some of the strengths of intrinsic motivation and hierarchical methods: the learning of useful skill is guided by a single proxy reward, the design of which requires very minimal domain knowledge about the downstream tasks. Then a high-level policy is trained on top of these skills, providing a significant improvement of the exploration and allowing to tackle sparse rewards in the downstream tasks. To efficiently pre-train a large span of skills, we use Stochastic Neural Networks combined with an information-theoretic regularizer. Our experiments111Code available at: https://github.com/florensacc/snn4hrl show222Videos available at: http://bit.ly/snn4hrl-videos that this combination is effective in learning a wide span of interpretable skills in a sample-efficient way, and can
原文 arXiv:1704.03012;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1704.03012v1