Influence-aware memory architectures for deep reinforcement learning in POMDPs

Journal Article (2022)
Author(s)

Miguel Suau (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Jinke He (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Elena Congeduti (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Rolf Starre (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Aleksander Czechowski (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Frans A. Oliehoek (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Research Group
Interactive Intelligence
DOI related publication
https://doi.org/10.1007/s00521-022-07691-7 Final published version
More Info
expand_more
Publication Year
2022
Language
English
Research Group
Interactive Intelligence
Journal title
Neural Computing and Applications
Issue number
19
Volume number
37
Pages (from-to)
13145-13161
Downloads counter
322
Collections
Institutional Repository
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Due to its perceptual limitations, an agent may have too little information about the environment to act optimally. In such cases, it is important to keep track of the action-observation history to uncover hidden state information. Recent deep reinforcement learning methods use recurrent neural networks (RNN) to memorize past observations. However, these models are expensive to train and have convergence difficulties, especially when dealing with high dimensional data. In this paper, we propose influence-aware memory, a theoretically inspired memory architecture that alleviates the training difficulties by restricting the input of the recurrent layers to those variables that influence the hidden state information. Moreover, as opposed to standard RNNs, in which every piece of information used for estimating Q values is inevitably fed back into the network for the next prediction, our model allows information to flow without being necessarily stored in the RNN’s internal memory. Results indicate that, by letting the recurrent layers focus on a small fraction of the observation variables while processing the rest of the information with a feedforward neural network, we can outperform standard recurrent architectures both in training speed and policy performance. This approach also reduces runtime and obtains better scores than methods that stack multiple observations to remove partial observability.