SOTAVerified

GAN Q-learning

2018-05-13Code Available0· sign in to hype

Thang Doan, Bogdan Mazoure, Clare Lyle

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Distributional reinforcement learning (distributional RL) has seen empirical success in complex Markov Decision Processes (MDPs) in the setting of nonlinear function approximation. However, there are many different ways in which one can leverage the distributional approach to reinforcement learning. In this paper, we propose GAN Q-learning, a novel distributional RL method based on generative adversarial networks (GANs) and analyze its performance in simple tabular environments, as well as OpenAI Gym. We empirically show that our algorithm leverages the flexibility and blackbox approach of deep learning models while providing a viable alternative to traditional methods.

Tasks

Reproductions