Regularization Matters in Policy Optimization
Deep Reinforcement Learning has been receiving increasingly more attention thanks to its encouraging performance on a variety of control tasks.Yet, conventional regularization techniques in training neural networks have been largely ignored in RL methods, possibly because agents are typically trained and evaluated in the same environment.In this work, we present the first comprehensive study of regularization techniques with multiple policy optimization algorithms on continuous control tasks.Interestingly, we find conventional regularization techniques on the policy networks can often bring large improvement on the task performance, and the improvement is typically more significant when the task is more difficult.We also compare with the widely used entropy regularization and find regularization is generally better.Our findings are further confirmed to be robust against the choice of training hyperparameters.We also study the effects of regularizing different components and find that only regularizing the policy network is typically enough.We hope our study provides guidance for future practices in regularizing policy optimization algorithms.
We show that conventional regularization methods (e.g.,, dropout), which have been largely ignored in RL methods, can be very effective in policy optimization.The authors study a set of existing direct policy optimization methods in the field of reinforcement learning and provide a detailed investigation on the effect of regulations on the performance and behavior of agents following these methods.This paper provides a study on the effect of regularization on performance in training environments in policy optimization methods in multiple continuous control tasks.