Faster Deep Reinforcement Learning with Slower Online Network
Kavosh Asadi, Rasool Fakoor, Omer Gottesman, Taesup Kim, Michael L. Littman, Alexander J. Smola
Abstract
Deep reinforcement learning algorithms often use two networks for value function optimization: an online network, and a target network that tracks the online network with some delay. Using two separate networks enables the agent to hedge against issues that arise when performing bootstrapping. In this paper we endow two popular deep reinforcement learning algorithms, namely DQN and Rainbow, with updates that incentivize the online network to remain in the proximity of the target network. This improves the robustness of deep reinforcement learning in presence of noisy updates. The resultant agents, called DQN Pro and Rainbow Pro, exhibit significant performance improvements over their original counterparts on the Atari benchmark demonstrating the effectiveness of this simple idea in deep reinforcement learning. The code for our paper is available here: Github.com/amazon-research/fast-rl-with-slow-updates.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext dbac3a4e-fd1f-4574-95fb-b39f7142702aCited by top-tier papers5
- Resetting the Optimizer in Deep RL: An Empirical StudyKavosh Asadi, Rasool Fakoor, Shoham SabachNeurIPS 2023 · 38 citations
- TD Convergence: An Optimization PerspectiveKavosh Asadi, Shoham Sabach, Yao Liu, Omer Gottesman et al.NeurIPS 2023 · 17 citations
- Learning the Target Network in Function SpaceKavosh Asadi, Yao Liu, Shoham Sabach, Ming Yin et al.ICML 2024 · 3 citations
- Preserve and Personalize: Personalized Text-to-Image Diffusion Models without Distributional DriftGihoon Kim, Hyungjin Park, Taesup KimICLR 2026 · 1 citation
- Reinforcement Learning from Imperfect Corrective Actions and Proxy RewardsZhaohui Jiang, Xuening Feng, Paul Weng, Yifei Zhu et al.ICLR 2025
Builds on5
- Meta-Q-LearningRasool Fakoor, Pratik Chaudhari, Stefano Soatto, Alexander J. SmolaICLR 2020 · 162 citations
- Mirror Descent Policy OptimizationManan Tomar, Lior Shani, Yonathan Efroni, Mohammad GhavamzadehICLR 2022 · 111 citations
- Breaking the Deadly Triad with a Target NetworkShangtong Zhang, Hengshuai Yao, Shimon WhitesonICML 2021 · 61 citations
- Deep Radial-Basis Value Functions for Continuous ControlKavosh Asadi, Neev Parikh, Ronald E. Parr, George Dimitri Konidaris et al.AAAI 2021 · 25 citations
- On the Convergence of Smooth Regularized Approximate Value Iteration SchemesElena Smirnova, Elvis DohmatobNeurIPS 2020 · 8 citations
Related papers
- Munchausen Reinforcement LearningNino Vieillard, Olivier Pietquin, Matthieu GeistNeurIPS 2020 · 120 citations
- DNA: Proximal Policy Optimization with a Dual Network ArchitectureMatthew Aitchison, Penny SweetserNeurIPS 2022 · 7 citations
- Use the Online Network If You Can: Towards Fast and Stable Reinforcement LearningAhmed Hendawy, Henrik Metternich, Théo Vincent, Mahdi Kallel et al.ICLR 2026 · 4 citations
- A new convergent variant of Q-learning with linear function approximationDiogo S. Carvalho, Francisco S. Melo, Pedro SantosNeurIPS 2020 · 39 citations
- Simplifying Deep Temporal Difference LearningMatteo Gallici, Mattie Fellows, Benjamin Ellis, Bartomeu Pou et al.ICLR 2025 · 1 citation
