Skip to content

Latest commit

 

History

History
12 lines (8 loc) · 775 Bytes

GANQL.md

File metadata and controls

12 lines (8 loc) · 775 Bytes

GAN Q-learning

Thang Doan, Bogdan Mazoure, Clare Lyle McGill University

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.