Recurrent Off-Policy Deep Reinforcement Learning Doesn't Have to be Slow
Tyler Clark, Christine Evers, Jonathon Hare

TL;DR
This paper introduces RISE, a method that enables recurrent off-policy deep reinforcement learning models to perform efficiently without high computational costs, significantly improving performance on Atari benchmarks.
Contribution
The paper presents RISE, a novel framework that integrates recurrent networks into off-policy RL algorithms efficiently using simplified encodings, reducing computational overhead.
Findings
35.6% IQM performance improvement on Atari
Effective integration of recurrent networks without added computational costs
Versatile framework applicable to various off-policy RL algorithms
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Domain Adaptation and Few-Shot Learning · Advanced Neural Network Applications
