Pith. sign in

REVIEW 1 cited by

TD or not TD: Analyzing the Role of Temporal Differencing in Deep Reinforcement Learning

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 1806.01175 v1 pith:3JIBQXNX submitted 2018-06-04 cs.LG cs.AIstat.ML

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

Our understanding of reinforcement learning (RL) has been shaped by theoretical and empirical results that were obtained decades ago using tabular representations and linear function approximators. These results suggest that RL methods that use temporal differencing (TD) are superior to direct Monte Carlo estimation (MC). How do these results hold up in deep RL, which deals with perceptually complex environments and deep nonlinear models? In this paper, we re-examine the role of TD in modern deep RL, using specially designed environments that control for specific factors that affect performance, such as reward sparsity, reward delay, and the perceptual complexity of the task. When comparing TD with infinite-horizon MC, we are able to reproduce classic results in modern settings. Yet we also find that finite-horizon MC is not inferior to TD, even when rewards are sparse or delayed. This makes MC a viable alternative to TD in deep RL.

Discussion (0). Continue with ORCID 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. To bootstrap or to rollout? An optimal and adaptive interpolation

    cs.LG 2024-11 conditional novelty 7.0 of 10

    Subgraph Bellman operators give a policy evaluation estimator whose finite-sample error nearly matches TD's optimal asymptotic variance while retaining MC's occupancy-adaptive sample complexity.

Pith tools