Why Linear Recurrent Memory Works in Partially Observable Reinforcement Learning
On the map: Deep reinforcement learning methods → Deep RL algorithms and representations
Abstract (arXiv)
The family of linear recurrent neural networks has shown strong performance as recurrent memory units in partially observable reinforcement learning. We provide a theoretical justification for their empirical effectiveness by constructing and studying two linear filters: (i) the first exactly reproduces the pre-softmax logits of the belief vector in a hidden Markov model (HMM) under a deterministic transition matrix, thereby serving as a sufficient statistic for optimal policy learning, (ii) the second achieves vanishing state-decoding error under a nearly deterministic transition matrix, thus reducing state ambiguity to near zero. The results extend to action-controlled HMMs, where the corresponding linear filters become time-varying with action-dependent dynamics. We illustrate our main results through numerical experiments and further show that the constructed linear filter serves as a strong feature extractor in a small reinforcement learning game.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Deep RL algorithms and representations, one of 15 directions in Deep reinforcement learning methods. Builds on 19 of its 35 references that are in the map. First posted on arXiv 29 May 2026.
Builds on
19 of 35 references.
Closest ancestors · 3
Same direction, newest first
- 2026Investigating Action Encodings in Recurrent Neural Networks in Reinforcement Learning4 May
- 2025Partially Observable Reinforcement Learning with Memory Traces19 Mar
- 2024Rethinking Transformers in Solving POMDPs27 May
Other references · 16
- 2017Attention Is All You Needcited by 60,361
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,465
- 2022Simplified State Space Layers for Sequence Modelingcited by 788
- 2023Gated Linear Attention Transformers with Hardware-Efficient Trainingcited by 514
- 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 408
- 2024Parallelizing Linear Transformers with the Delta Rule over Sequence Lengthcited by 396
- 2021Recurrent Model-Free RL Can Be a Strong Baseline for Many POMDPscited by 122
- 2023Structured State Space Models for In-Context Reinforcement Learningcited by 111
- 2024Unlocking State-Tracking in Linear RNNs Through Negative Eigenvaluescited by 101
- 2022When Is Partially Observable Reinforcement Learning Not Scary?cited by 100
4 more
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Does Learning Recurrent Networks Matter in Partially Observable RL?
- 2024Recurrent Reinforcement Learning with Memoroids
- 2026Belief-State RWKV for Reinforcement Learning under Partial Observability
- 2025Bi-directional Recurrence Improves Transformer in Partially Observable Markov Decision Processes
- 2024Uncertainty Representations in State-Space Layers for Deep Reinforcement Learning under Partial Observability
- 2025Zero-Shot Reinforcement Learning Under Partial Observability
- 2024Efficient Recurrent Off-Policy RL Requires a Context-Encoder-Specific Learning Rate
- 2018Learning Finite State Representations of Recurrent Policy Networks