mlsanityData to 7 Oct 2026

Discerning Temporal Difference Learning

arXiv 2310.08091 ↗First posted 12 Oct 2023cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Temporal difference learning (TD) is a foundational concept in reinforcement learning (RL), aimed at efficiently assessing a policy's value function. TD(λ), a potent variant, incorporates a memory trace to distribute the prediction error into the historical context. However, this approach often neglects the significance of historical states and the relative importance of propagating the TD error, influenced by challenges such as visitation imbalance or outcome noise. To address this, we propose a novel TD algorithm named discerning TD learning (DTD), which allows flexible emphasis functions-predetermined or adapted during training-to allocate efforts effectively across states. We establish the convergence properties of our method within a specific class of emphasis functions and showcase its promising potential for adaptation to deep RL contexts. Empirical results underscore that employing a judicious emphasis function not only improves value estimation but also expedites learning across diverse scenarios.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 31 references that are in the map. First posted on arXiv 12 Oct 2023.

Builds on

18 of 31 references.

References · 18

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  3. 2015Trust Region Policy Optimizationcited by 2,503
  4. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
  5. 2015Prioritized Experience Replaycited by 1,070
  6. 2019When to Trust Your Model: Model-Based Policy Optimizationcited by 753
  7. 2018Sample-Efficient Reinforcement Learning with Stochastic Ensemble Value Expansioncited by 167
  8. 2015An Emphatic Approach to the Problem of Off-policy Temporal-Difference Learningcited by 103
  9. 2018Reinforcement Learning with Perturbed Rewardscited by 76
  10. 2020An Equivalence between Loss Functions and Non-Uniform Sampling in Experience Replaycited by 41
  11. 2018An Off-policy Policy Gradient Theorem Using Emphatic Weightingscited by 34
  12. 2020Options of Interest: Temporal Abstraction with Interest Functionscited by 30
6 more
  1. 2020Selective Dyna-style Planning Under Limited Model Capacitycited by 30
  2. 2020Understanding and Mitigating the Limitations of Prioritized Experience Replaycited by 16
  3. 2022Continual Auxiliary Task Learningcited by 9
  4. 2021Preferential Temporal Difference Learningcited by 6
  5. 2022Selective Credit Assignmentcited by 4
  6. 2023Distillation Policy Optimizationcited by 1

Built on by

Not cited yet.