mlsanityData to 7 Oct 2026

SPEQ: Offline Stabilization Phases for Efficient Q-Learning in High Update-To-Data Ratio Reinforcement Learning

arXiv 2501.08669 ↗First posted 15 Jan 2025cs.LG cs.AIcited by 7

Not on the map. Why?

Abstract (arXiv)

High update-to-data (UTD) ratio algorithms in reinforcement learning (RL) improve sample efficiency but incur high computational costs, limiting real-world scalability. We propose Offline Stabilization Phases for Efficient Q-Learning (SPEQ), an RL algorithm that combines low-UTD online training with periodic offline stabilization phases. During these phases, Q-functions are fine-tuned with high UTD ratios on a fixed replay buffer, reducing redundant updates on suboptimal data. This structured training schedule optimally balances computational and sample efficiency, addressing the limitations of both high and low UTD ratio approaches. We empirically demonstrate that SPEQ requires from 40% to 99% fewer gradient updates and 27% to 78% less training time compared to state-of-the-art high UTD ratio methods while maintaining or surpassing their performance on the MuJoCo continuous control benchmark. Our findings highlight the potential of periodic stabilization phases as an effective alternative to conventional training schedules, paving the way for more scalable reinforcement learning solutions in real-world applications where computational resources are constrained.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 22 of its 29 references that are in the map. First posted on arXiv 15 Jan 2025.

Builds on

22 of 29 references.

References · 22

  1. 2016Layer Normalizationcited by 5,579
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  3. 2015Continuous control with deep reinforcement learningcited by 3,279
  4. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  5. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
  6. 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,777
  7. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
  8. 2021Offline Reinforcement Learning with Implicit Q-Learningcited by 1,245
  9. 2021A Minimalist Approach to Offline Reinforcement Learningcited by 882
  10. 2019When to Trust Your Model: Model-Based Policy Optimizationcited by 753
  11. 2020AWAC: Accelerating Online Reinforcement Learning with Offline Datasetscited by 647
  12. 2018Learning Dexterous In-Hand Manipulationcited by 643
10 more
  1. 2017A Brief Survey of Deep Reinforcement Learningcited by 466
  2. 2021Randomized Ensembled Double Q-Learning: Learning Fast Without a Modelcited by 278
  3. 2024Deep Reinforcement Learning for Robotics: A Survey of Real-World Successescited by 153
  4. 2023Bigger, Better, Faster: Human-level Atari with human-level efficiencycited by 145
  5. 2020Maxmin Q-learning: Controlling the Estimation Bias of Q-learningcited by 117
  6. 2024SERL: A Software Suite for Sample-Efficient Robotic Reinforcement Learningcited by 113
  7. 2021Dropout Q-Functions for Doubly Efficient Reinforcement Learningcited by 108
  8. 2023Deep Reinforcement Learning with Plasticity Injectioncited by 71
  9. 2021Efficient Deep Reinforcement Learning with Imitative Expert Priors for Autonomous Drivingcited by 46
  10. 2023Off-Policy RL Algorithms Can be Sample-Efficient for Continuous Control via Sample Multiple Reusecited by 12

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 6.

7 papers.