A

Two-Memory Reinforcement Learning

IEEE Conference on Games (CoG), pp. 1–9

Abstract

While deep reinforcement learning has shown important empirical success, it tends to learn relatively slow due to slow propagation of rewards information and slow update of parametric neural networks. Non-parametric episodic memory, on the other hand, provides a faster learning alternative that does not require representation learning and uses maximum episodic return as state-action values for action selection. Episodic memory and reinforcement learning both have their own strengths and weaknesses. Notably, humans can leverage multiple memory systems concurrently during learning and benefit from all of them. In this work, we propose a method called Two-Memory reinforcement learning agent (2M) that combines episodic memory and reinforcement learning to distill both of their strengths. The 2M agent exploits the speed of the episodic memory part and the optimality and the generalization capacity of the reinforcement learning part to complement each other. Our experiments demonstrate that the 2M agent is more data efficient and outperforms both pure episodic memory and pure reinforcement learning, as well as a state-of-the-art memory-augmented RL agent. Moreover, the proposed approach provides a general framework that can be used to combine any episodic memory agent with other off-policy reinforcement learning algorithms.1

Authors 4

  1. Yang Zhao Aachen

    Leiden University

    Affiliation as printed

    Leiden Institute of Advanced Computer Science Leiden University

  2. Leiden University

    Affiliation as printed

    Leiden Institute of Advanced Computer Science Leiden University

  3. Mike Preuß Aachen

    Leiden University

    Affiliation as printed

    Leiden Institute of Advanced Computer Science Leiden University

  4. Aske Plaat Aachen

    Leiden University

    Affiliation as printed

    Leiden Institute of Advanced Computer Science Leiden University

Cited by 2 stored of 2

2 results

No patents citing this paper on Lens.org (checked 2026-10-11).

References 33