Deep Reinforcement Learning with Modulated Hebbian plus Q Network Architecture
Not on the map. Why?
Abstract (arXiv)
This paper presents a new neural architecture that combines a modulated Hebbian network (MOHN) with DQN, which we call modulated Hebbian plus Q network architecture (MOHQA). The hypothesis is that such a combination allows MOHQA to solve difficult partially observable Markov decision process (POMDP) problems which impair temporal difference (TD)-based RL algorithms such as DQN, as the TD error cannot be easily derived from observations. The key idea is to use a Hebbian network with bio-inspired neural traces in order to bridge temporal delays between actions and rewards when confounding observations and sparse rewards result in inaccurate TD errors. In MOHQA, DQN learns low level features and control, while the MOHN contributes to the high-level decisions by associating rewards with past states and actions. Thus the proposed architecture combines two modules with significantly different learning algorithms, a Hebbian associative network and a classical DQN pipeline, exploiting the advantages of both. Simulations on a set of POMDPs and on the MALMO environment show that the proposed algorithm improved DQN's results and even outperformed control tests with A2C, QRDQN+LSTM and REINFORCE algorithms on some POMDPs with confounding stimuli and sparse rewards.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 3.
5 papers.
- 2023A Domain-Agnostic Approach for Characterization of Lifelong Learning Systemscited by 13
- 2021Context Meta-Reinforcement Learning via Neuromodulationcited by 11
- 2023Real-Time Recurrent Reinforcement Learningcited by 6
- 2023The configurable tree graph (CT-graph): measurable problems in partially observable and distal reward environments for lifelong reinforcement learningcited by 3
- 2021Reinforcement Learning With Sparse-Executing Actions via Sparsity Regularizationcited by 2
- 2023Real-Time Recurrent Reinforcement Learning8 Nov 2023
- 2023The configurable tree graph (CT-graph): measurable problems in partially observable and distal reward environments for lifelong reinforcement learning21 Jan 2023
- 2023A Domain-Agnostic Approach for Characterization of Lifelong Learning Systems18 Jan 2023
- 2021Context Meta-Reinforcement Learning via Neuromodulation30 Oct 2021
- 2021Reinforcement Learning With Sparse-Executing Actions via Sparsity Regularization18 May 2021