Recurrent Off-Policy Deep Reinforcement Learning Doesn't Have to be Slow

Tyler Clark, Christine Evers, Jonathon Hare
12/23/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Recurrent off-policy deep reinforcement learning models achieve state-of-the-art performance but are often sidelined due to their high computational demands. In response, we introduce RISE (Recurrent Integration via Simplified Encodings), a novel approach that can leverage recurrent networks in any image-based off-policy RL setting without significant computational overheads via using both learnable and non-learnable encoder layers. When integrating RISE into leading non-recurrent off-policy RL algorithms, we observe a 35.6% human-normalized interquartile mean (IQM) performance improvement across the Atari benchmark. We analyze various implementation strategies to highlight the versatility and potential of our proposed framework.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{clark2025recurrent,
  title  = {Recurrent Off-Policy Deep Reinforcement Learning Doesn't Have to be Slow},
  author = {Tyler Clark and Christine Evers and Jonathon Hare},
  year   = {2025},
  eprint = {2512.20513},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.20513v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.20513.svg)](https://codeofpaper.com/paper/2512.20513)

Discussion