Intentional Updates for Streaming Reinforcement Learning
Arsalan Sharifnassab, Mohamed Elsayed, Kris De Asis, Rupam Mahmood, Rich Sutton
Abstract
In gradient-based learning, a step size chosen in parameter units does not produce a predictable per-step change in function output. This often leads to instability in the streaming setting (i.e., batch size), where stochasticity is not averaged out and update magnitudes can momentarily become arbitrarily big or small. Instead, we propose intentional updates: first specify the intended outcome of an update and then solve for the step size that approximately achieves it. This strategy has precedent in online supervised linear regression via Normalized Least Mean Squares (NLMS) algorithm, which selects a step size to yield a specified change in the function output proportional to the current error. We extend this principle to streaming deep reinforcement learning by defining appropriate intended outcomes: Intentional TD aims for a fixed fractional reduction of the TD error, and Intentional Policy Gradient aims for a bounded per-step change in the policy, limiting local KL divergence. We propose practical algorithms combining eligibility traces and diagonal scaling. Empirically, these methods yield state-of-the-art streaming performance, frequently performing on par with batch and replay-buffer approaches.
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.
Builds on1
Related papers
- Deep Policy Gradient Methods Without Batch Updates, Target Networks, or Replay BuffersGautham Vasan, Mohamed Elsayed, Seyed Alireza Azimi, Jiamin He et al.NeurIPS 2024 · 27 citations
- A Parametric Class of Approximate Gradient Updates for Policy OptimizationRamki Gummadi, Saurabh Kumar, Junfeng Wen, Dale SchuurmansICML 2022
- Parameter-free Optimal Rates for Nonlinear Semi-Norm Contractions with Applications to Q-LearningAnkur Naskar, Gugan Thoppe, Vijay GuptaAAAI 2026 · 1 citation
- Compute-Optimal Scaling for Value-Based Deep RLPreston Fu, Oleh Rybkin, Zhiyuan Zhou, Michal Nauman et al.NeurIPS 2025 · 7 citations
- Mean Field Langevin Actor-Critic: Faster Convergence and Global Optimality beyond Lazy LearningKakei Yamamoto, Kazusato Oko, Zhuoran Yang, Taiji SuzukiICML 2024 · 2 citations
