Learning to Play in a Day: Faster Deep Reinforcement Learning by Optimality TighteningDownload PDF

Published: 21 Jul 2022, Last Modified: 04 Jun 2023ICLR 2017 PosterReaders: Everyone
TL;DR: We propose a novel training algorithm for reinforcement learning which combines the strength of deep Q-learning with a constrained optimization approach to tighten optimality and encourage faster reward propagation.
Abstract: We propose a novel training algorithm for reinforcement learning which combines the strength of deep Q-learning with a constrained optimization approach to tighten optimality and encourage faster reward propagation. Our novel technique makes deep reinforcement learning more practical by drastically reducing the training time. We evaluate the performance of our approach on the 49 games of the challenging Arcade Learning Environment, and report significant improvements in both training time and accuracy.
Keywords: Reinforcement Learning, Optimization, Games
Conflicts: toronto.edu, illinois.edu
Community Implementations: [![CatalyzeX](/images/catalyzex_icon.svg) 1 code implementation](https://www.catalyzex.com/paper/arxiv:1611.01606/code)
28 Replies

Loading