HTMRL: Biologically Plausible Reinforcement Learning With Hierarchical Temporal Memory

Abstract

Building Reinforcement Learning (RL) algorithms which are able to adapt to continuously evolving tasks is an open research challenge. One technology that is known to inherently handle such non-stationary input patterns well is Hierarchical Temporal Memory (HTM), a general and biologically plausible computational model for the human neocortex. As the RL paradigm is inspired by human learning, HTM is a natural framework for an RL algorithm supporting non-stationary environments. In this paper, we present HTMRL, the first strictly HTM-based RL algorithm. We empirically and statistically show that HTMRL scales to many states and actions, and demonstrate that HTM's ability for adapting to changing patterns extends to RL. Specifically, HTMRL performs well on a 10-armed bandit after 750 steps, but only needs a third of that to adapt to the bandit suddenly shuffling its arms. HTMRL is the first iteration of a novel RL approach, with the potential of extending to a capable algorithm for Meta-RL

Stats

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

Related papers

• Exploring The Limits Of Hierarchical World Models In Reinforcement Learning (2024)6.34
• Boosting Hierarchical Reinforcement Learning With Meta-learning For Complex Task Adaptation (2024)0.00
• Learning Representations In Model-free Hierarchical Reinforcement Learning (2018)11.49
• HMRL: Hyper-meta Learning For Sparse Reward Reinforcement Learning Problem (2020)0.00
• A Provably Efficient Option-based Algorithm For Both High-level And Low-level Learning (2024)0.00
• Emergent Temporal Abstractions In Autoregressive Models Enable Hierarchical Reinforcement Learning (2025)0.00
• Multi-horizon Representations With Hierarchical Forward Models For Reinforcement Learning (2022)0.00
• Hierarchical Reinforcement Learning In Complex 3D Environments (2023)0.00