Pith. sign in

REVIEW 3 cited by

Streaming Deep Reinforcement Learning Finally Works

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.14606 v2 pith:SZHIKSAJ submitted 2024-10-18 cs.LG cs.AI

classification cs.LGcs.AI
keywords algorithmslearningstreamdeepstreamingbarrierbatchcontrol
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Natural intelligence processes experience as a continuous stream, sensing, acting, and learning moment-by-moment in real time. Streaming learning, the modus operandi of classic reinforcement learning (RL) algorithms like Q-learning and TD, mimics natural learning by using the most recent sample without storing it. This approach is also ideal for resource-constrained, communication-limited, and privacy-sensitive applications. However, in deep RL, learners almost always use batch updates and replay buffers, making them computationally expensive and incompatible with streaming learning. Although the prevalence of batch deep RL is often attributed to its sample efficiency, a more critical reason for the absence of streaming deep RL is its frequent instability and failure to learn, which we refer to as stream barrier. This paper introduces the stream-x algorithms, the first class of deep RL algorithms to overcome stream barrier for both prediction and control and match sample efficiency of batch RL. Through experiments in Mujoco Gym, DM Control Suite, and Atari Games, we demonstrate stream barrier in existing algorithms and successful stable learning with our stream-x algorithms: stream Q, stream AC, and stream TD, achieving the best model-free performance in DM Control Dog environments. A set of common techniques underlies the stream-x algorithms, enabling their success with a single set of hyperparameters and allowing for easy extension to other algorithms, thereby reviving streaming RL.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Endpoint Replay: Compressing the Recency Buffer in Deep Reinforcement Learning

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Chained n-step endpoint coresets plus expectile Sarsa match million-transition DQN buffers at 10–50× less storage by keeping bootstrap targets anchored.

  2. Incremental Residual Reinforcement Learning Toward Real-World Learning for Social Navigation

    cs.RO 2026-04 unverdicted novelty 5.5 of 10

    IRRL lets robots learn social navigation in the real world by incrementally updating only the differences from a base policy, matching replay-buffer methods in simulation and adapting to new settings on physical robots.

  3. Designing Adaptive Algorithms Based on Reinforcement Learning for Dynamic Optimization of Sliding Window Size in Multi-Dimensional Data Streams

    cs.LG 2025-07 reject novelty 4.0 of 10

    A DQN-based reinforcement learning agent that dynamically chooses sliding window sizes is claimed to improve classification accuracy on multi-dimensional streams, but the reported evaluation is inconsistent and not re...

Pith tools