Pith. sign in

REVIEW 2 cited by

Revisiting Fundamentals of Experience Replay

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 2007.06700 v1 pith:6COK5DP3 submitted 2020-07-13 cs.LG stat.ML

classification cs.LGstat.ML
keywords replayexperiencealgorithmsratiocapacitydeeplearningperformance
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Experience replay is central to off-policy algorithms in deep reinforcement learning (RL), but there remain significant gaps in our understanding. We therefore present a systematic and extensive analysis of experience replay in Q-learning methods, focusing on two fundamental properties: the replay capacity and the ratio of learning updates to experience collected (replay ratio). Our additive and ablative studies upend conventional wisdom around experience replay -- greater capacity is found to substantially increase the performance of certain algorithms, while leaving others unaffected. Counterintuitively we show that theoretically ungrounded, uncorrected n-step returns are uniquely beneficial while other techniques confer limited benefit for sifting through larger memory. Separately, by directly controlling the replay ratio we contextualize previous observations in the literature and empirically measure its importance across a variety of deep RL algorithms. Finally, we conclude by testing a set of hypotheses on the nature of these performance benefits.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Beyond Isolation: Unlocking Reinforcement Learning Component Synergy for Sample-Efficient Continuous Control

    cs.LG 2026-08 conditional novelty 6.0 of 10

    Coordinating optimization stability, model-based representation, and scheduled prioritized replay yields larger sample-efficiency gains than naively stacking the same components in continuous-control RL.

  2. Fair Distributed Machine Learning with Imbalanced Data as a Stackelberg Evolutionary Game

    cs.LG 2024-12 reject novelty 4.0 of 10

    The paper proposes DSWM and ASWM, two Stackelberg-game-inspired algorithms that reweight node contributions in federated learning, and reports modest AUC gains for small-data nodes on three MedMNIST datasets.

Pith tools