A New Reward System Based on Human Demonstrations for Hard Exploration Games
Source abstract
Abstract
The main idea of reinforcement learning is evaluating the chosen action depending on the current reward. According to this concept, many algorithms achieved proper performance on classic Atari 2600 games. The main challenge is when the reward is sparse or missing. Such environments are complex exploration environments like Montezuma’s Revenge, Pitfall, and Private Eye games. Approaches built to deal with such challenges were very demanding. This work introduced a different reward system that enables the simple classical algorithm to learn fast and achieve high performance in hard exploration environments. Moreover, we added some simple enhancements to several hyperparameters, such as the number of actions and the sampling ratio that helped improve performance. We include the extra reward within the human demonstrations. After that, we used Prioritized Double Deep Q-Networks (Prioritized DDQN) to learning from these demonstrations. Our approach enabled the Prioritized DDQN with a short learning time to finish the first level of Montezuma’s Revenge game and to perform well in both Pitfall and Private Eye. We used the same games to compare our results with several baselines, such as the Rainbow and Deep Q-learning from demonstrations (DQfD) algorithm. The results showed that the new rewards system enabled Prioritized DDQN to out-perform the baselines in the hard exploration games with short learning time.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Reinforcement Learning in Robotics · Artificial Intelligence in Games · Evolutionary Algorithms and Applications
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (21)
Show source-provided references
1. Human-level control through deep reinforcement learning10.1038/nature14236 ↗
2. Deep q-learning from demonstrations
3. Learning montezuma’s revenge from a single demonstration
4. Go-explore: A new approach for hard-exploration problems
5. Mastering the game of go with deep neural networks and tree search10.1038/nature16961 ↗
6. A reduction of imitation learning and structured prediction to no-regret online learning
7. Deeply aggrevated: Differentiable imitation learning for sequential prediction
8. Playing atari with deep reinforcement learning
9. Deep reinforcement learning with double q-learning
10. Prioritized experience replay
11. Dueling network architectures for deep reinforcement learning
12. Asynchronous methods for deep reinforcement learning
13. A distributional perspective on reinforcement learning
14. Noisy networks for exploration
15. Rainbow : Combining improvements in deep reinforcement learning
16. Playing hard exploration games by watching YouTube
17. Observe and look further: Achieving consistent performance on atari
18. Bridging the gap between imitation learning and inverse reinforcement learning10.1109/TNNLS.2016.2543000 ↗
19. DQNViz: A visual analytics approach to understand deep q-networks10.1109/TVCG.2018.2864504 ↗
20. Q-learning10.1007/BF00992698 ↗
21. The arcade learning environment: An evaluation platform for general agents10.1613/jair.3912 ↗