Pith. sign in

REVIEW 1 cited by

Revisiting Prioritized Experience Replay: A Value Perspective

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 2102.03261 v1 pith:YGYQ42DQ submitted 2021-02-05 cs.LG

classification cs.LG
keywords experiencetextvaluereplayexperiencesboundscumulativeframework
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Experience replay enables off-policy reinforcement learning (RL) agents to utilize past experiences to maximize the cumulative reward. Prioritized experience replay that weighs experiences by the magnitude of their temporal-difference error ($|\text{TD}|$) significantly improves the learning efficiency. But how $|\text{TD}|$ is related to the importance of experience is not well understood. We address this problem from an economic perspective, by linking $|\text{TD}|$ to value of experience, which is defined as the value added to the cumulative reward by accessing the experience. We theoretically show the value metrics of experience are upper-bounded by $|\text{TD}|$ for Q-learning. Furthermore, we successfully extend our theoretical framework to maximum-entropy RL by deriving the lower and upper bounds of these value metrics for soft Q-learning, which turn out to be the product of $|\text{TD}|$ and "on-policyness" of the experiences. Our framework links two important quantities in RL: $|\text{TD}|$ and value of experience. We empirically show that the bounds hold in practice, and experience replay using the upper bound as priority improves maximum-entropy RL in Atari games.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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.

Pith tools