Intentional Updates for Streaming Reinforcement Learning
Arsalan Sharifnassab, Mohamed Elsayed, Kris De Asis, Rupam Mahmood, Rich Sutton
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper1
相关 Paper
- Deep Policy Gradient Methods Without Batch Updates, Target Networks, or Replay BuffersGautham Vasan, Mohamed Elsayed, Seyed Alireza Azimi, Jiamin He 等NeurIPS 2024 · 被引用 27 次
- 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 次
- Compute-Optimal Scaling for Value-Based Deep RLPreston Fu, Oleh Rybkin, Zhiyuan Zhou, Michal Nauman 等NeurIPS 2025 · 被引用 7 次
- Mean Field Langevin Actor-Critic: Faster Convergence and Global Optimality beyond Lazy LearningKakei Yamamoto, Kazusato Oko, Zhuoran Yang, Taiji SuzukiICML 2024 · 被引用 2 次
