Active Reinforcement Learning over MDPs
Not on the map. Why?
Abstract (arXiv)
The past decade has seen the rapid development of Reinforcement Learning, which acquires impressive performance with numerous training resources. However, one of the greatest challenges in RL is generalization efficiency (i.e., generalization performance in a unit time). This paper proposes a framework of Active Reinforcement Learning (ARL) over MDPs to improve generalization efficiency in a limited resource by instance selection. Given a number of instances, the algorithm chooses out valuable instances as training sets while training the policy, thereby costing fewer resources. Unlike existing approaches, we attempt to actively select and use training data rather than train on all the given data, thereby costing fewer resources. Furthermore, we introduce a general instance evaluation metrics and selection mechanism into the framework. Experiments results reveal that the proposed framework with Proximal Policy Optimization as policy optimizer can effectively improve generalization efficiency than unselect-ed and unbiased selected methods.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 29 references that are in the map. First posted on arXiv 5 Aug 2021.
Builds on
23 of 29 references.
References · 23
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2015Trust Region Policy Optimizationcited by 2,580
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
- 2016OpenAI Gymcited by 1,736
- 2017Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real Worldcited by 1,498
- 2020Image Augmentation Is All You Need: Regularizing Deep Reinforcement Learning from Pixelscited by 585
- 2020Reinforcement Learning with Augmented Datacited by 468
- 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 389
- 2018Quantifying Generalization in Reinforcement Learningcited by 352
- 2020First return, then explorecited by 266
- 2019Network Randomization: A Simple Technique for Generalization in Deep Reinforcement Learningcited by 104
- 2019Generalization in Reinforcement Learning with Selective Noise Injection and Information Bottleneckcited by 101
11 more
- 2020Deep Learning for Procedural Content Generationcited by 73
- 2017Towards Generalization and Simplicity in Continuous Controlcited by 68
- 2019Increasing Generality in Machine Learning through Procedural Content Generationcited by 59
- 2018Transfer Learning for Related Reinforcement Learning Tasks via Image-to-Image Translationcited by 50
- 2020Discount Factor as a Regularizer in Reinforcement Learningcited by 45
- 2020Invariant Policy Optimization: Towards Stronger Generalization in Reinforcement Learningcited by 37
- 2020Trajectory-wise Multiple Choice Learning for Dynamics Generalization in Reinforcement Learningcited by 35
- 2018StarCraft Micromanagement with Reinforcement Learning and Curriculum Transfer Learningcited by 25
- 2020Rotation, Translation, and Cropping for Zero-Shot Generalizationcited by 24
- 2021When Is Generalizable Reinforcement Learning Tractable?cited by 20
- 2018Deep Curiosity Search: Intra-Life Exploration Can Improve Performance on Challenging Deep Reinforcement Learning Problemscited by 12
Built on by
Not cited yet.