SOTAVerified

Explicit Recall for Efficient Exploration

2019-05-01ICLR 2019Unverified0· sign in to hype

Honghua Dong, Jiayuan Mao, Xinyue Cui, Lihong Li

Unverified — Be the first to reproduce this paper.

Reproduce

Abstract

In this paper, we advocate the use of explicit memory for efficient exploration in reinforcement learning. This memory records structured trajectories that have led to interesting states in the past, and can be used by the agent to revisit those states more effectively. In high-dimensional decision making problems, where deep reinforcement learning is considered crucial, our approach provides a simple, transparent and effective way that can be naturally combined with complex, deep learning models. We show how such explicit memory may be used to enhance existing exploration algorithms such as intrinsically motivated ones and count-based ones, and demonstrate our method's advantages in various simulated environments.

Tasks

Reproductions