Amortized Variational Deep Q Network

Abstract

Efficient exploration is one of the most important issues in deep reinforcement learning. To address this issue, recent methods consider the value function parameters as random variables, and resort variational inference to approximate the posterior of the parameters. In this paper, we propose an amortized variational inference framework to approximate the posterior distribution of the action value function in Deep Q Network. We establish the equivalence between the loss of the new model and the amortized variational inference loss. We realize the balance of exploration and exploitation by assuming the posterior as Cauchy and Gaussian, respectively in a two-stage training process. We show that the amortized framework can results in significant less learning parameters than existing state-of-the-art method. Experimental results on classical control tasks in OpenAI Gym and chain Markov Decision Process tasks show that the proposed method performs significantly better than state-of-art methods and requires much less training time.

arXiv commentAccepted to appear in the Deep Reinforcement Learning Workshop at NeurIPS 2020

References in corpus (11)

• Auto-Encoding Variational Bayes
• Playing Atari with Deep Reinforcement Learning
• Variational Inference with Normalizing Flows
• Weight Uncertainty in Neural Networks
• StarCraft II: A New Challenge for Reinforcement Learning
• Deep Exploration via Randomized Value Functions
• Distributional Reinforcement Learning with Quantile Regression
• BBQ-Networks: Efficient Exploration in Deep Reinforcement Learning for Task-Oriented Dialogue Systems
• Distributional Reinforcement Learning for Efficient Exploration
• Variational Deep Q Network
• The Potential of the Return Distribution for Exploration in RL