An Adaptive Clipping Approach for Proximal Policy Optimization
arXiv:1804.06461
Abstract
Very recently proximal policy optimization (PPO) algorithms have been proposed as first-order optimization methods for effective reinforcement learning. While PPO is inspired by the same learning theory that justifies trust region policy optimization (TRPO), PPO substantially simplifies algorithm design and improves data efficiency by performing multiple epochs of \emph{clipped policy optimization} from sampled data. Although clipping in PPO stands for an important new mechanism for efficient and reliable policy update, it may fail to adaptively improve learning performance in accordance with the importance of each sampled state. To address this issue, a new surrogate learning objective featuring an adaptive clipping mechanism is proposed in this paper, enabling us to develop a new algorithm, known as PPO-. PPO- optimizes policies repeatedly based on a theoretical target for adaptive policy improvement. Meanwhile, destructively large policy update can be effectively prevented through both clipping and adaptive control of a hyperparameter in PPO-, ensuring high learning reliability. PPO- enjoys the same simple and efficient design as PPO. Empirically on several Atari game playing tasks and benchmark control tasks, PPO- also achieved clearly better performance than PPO.
References in corpus (10)
- Adam: A Method for Stochastic Optimization
- Continuous control with deep reinforcement learning
- Dueling Network Architectures for Deep Reinforcement Learning
- High-Dimensional Continuous Control Using Generalized Advantage Estimation
- Benchmarking Deep Reinforcement Learning for Continuous Control
- Scalable trust-region method for deep reinforcement learning using Kronecker-factored approximation
- #Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learning
- Bridging the Gap Between Value and Policy Based Reinforcement Learning
- Sample Efficient Actor-Critic with Experience Replay
- Interpolated Policy Gradient: Merging On-Policy and Off-Policy Gradient Estimation for Deep Reinforcement Learning
Cited by in corpus (6)
- Autonomous Drone Swarm Navigation and Multi-target Tracking in 3D Environments with Dynamic Obstacles
- Truly Proximal Policy Optimization
- Multi-Agent Deep Reinforcement Learning for Request Dispatching in Distributed-Controller Software-Defined Networking
- Effective Exploration for Deep Reinforcement Learning via Bootstrapped Q-Ensembles under Tsallis Entropy Regularization
- Policy Optimization With Penalized Point Probability Distance: An Alternative To Proximal Policy Optimization
- Off-Policy Actor-Critic in an Ensemble: Achieving Maximum General Entropy and Effective Environment Exploration in Deep Reinforcement Learning