Memory-efficient Episodic Control Reinforcement Learning With Dynamic Online K-means

Abstract

Recently, neuro-inspired episodic control (EC) methods have been developed to overcome the data-inefficiency of standard deep reinforcement learning approaches. Using non-/semi-parametric models to estimate the value function, they learn rapidly, retrieving cached values from similar past states. In realistic scenarios, with limited resources and noisy data, maintaining meaningful representations in memory is essential to speed up the learning and avoid catastrophic forgetting. Unfortunately, EC methods have a large space and time complexity. We investigate different solutions to these problems based on prioritising and ranking stored states, as well as online clustering techniques. We also propose a new dynamic online k-means algorithm that is both computationally-efficient and yields significantly better performance at smaller memory sizes; we validate this approach on classic reinforcement learning environments and Atari games.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyagostinelli2019memory

Related papers

• Continuous Episodic Control (2022)2.26
• Sequential Memory Improves Sample And Memory Efficiency In Episodic Control (2021)0.00
• Sample-efficient Reinforcement Learning With Maximum Entropy Mellowmax Episodic Control (2019)0.00
• Overcoming Catastrophic Interference In Online Reinforcement Learning With Dynamic Self-organizing Maps (2019)0.00
• Episodic Reinforcement Learning With Expanded State-reward Space (2024)0.00
• Integrating Episodic Memory Into A Reinforcement Learning Agent Using Reservoir Sampling (2018)0.00
• Towards Sample-efficient Episodic Control With DAC-ML (2020)0.00
• Learning, Fast And Slow: A Goal-directed Memory-based Approach For Dynamic Environments (2023)0.00