mlsanityData to 7 Oct 2026

A Generalized Bootstrap Target for Value-Learning, Efficiently Combining Value and Feature Predictions

arXiv 2201.01836 ↗First posted 5 Jan 2022cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Estimating value functions is a core component of reinforcement learning algorithms. Temporal difference (TD) learning algorithms use bootstrapping, i.e. they update the value function toward a learning target using value estimates at subsequent time-steps. Alternatively, the value function can be updated toward a learning target constructed by separately predicting successor features (SF)--a policy-dependent model--and linearly combining them with instantaneous rewards. We focus on bootstrapping targets used when estimating value functions, and propose a new backup target, the η-return mixture, which implicitly combines value-predictive knowledge (used by TD methods) with (successor) feature-predictive knowledge--with a parameter η capturing how much to rely on each. We illustrate that incorporating predictive knowledge through an ηγ-discounted SF model makes more efficient use of sampled experience, compared to either extreme, i.e. bootstrapping entirely on the value function estimate, or bootstrapping on the product of separately estimated successor features and instantaneous reward models. We empirically show this approach leads to faster policy evaluation and better control performance, for tabular and nonlinear function approximations, indicating scalability and generality.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 42 references that are in the map. First posted on arXiv 5 Jan 2022.

Builds on

25 of 42 references.

References · 25

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  3. 2015Continuous control with deep reinforcement learningcited by 3,279
  4. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
  5. 2015Prioritized Experience Replaycited by 1,070
  6. 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 769
  7. 2016Successor Features for Transfer in Reinforcement Learningcited by 331
  8. 2020Implicit Under-Parameterization Inhibits Data-Efficient Deep Reinforcement Learningcited by 134
  9. 2019Fast Task Inference with Variational Intrinsic Successor Featurescited by 131
  10. 2018Count-Based Exploration with the Successor Representationcited by 112
  11. 2017A Laplacian Framework for Option Discovery in Reinforcement Learningcited by 108
  12. 2018Universal Successor Features Approximatorscited by 102
13 more
  1. 2019Transfer in Deep Reinforcement Learning Using Successor Features and Generalised Policy Improvementcited by 88
  2. 2017Eigenoption Discovery through the Deep Successor Representationcited by 85
  3. 2016Deep Successor Reinforcement Learningcited by 72
  4. 2016Deep Reinforcement Learning with Successor Features for Navigation across Similar Environmentscited by 50
  5. 2018Successor Uncertainties: Exploration and Uncertainty in Temporal Difference Learningcited by 35
  6. 2020Expected Eligibility Tracescited by 27
  7. 2019Harnessing Structures for Value-Based Planning and Reinforcement Learningcited by 24
  8. 2020Universal Successor Features for Transfer Reinforcement Learningcited by 20
  9. 2018General Value Function Networkscited by 16
  10. 2020Forethought and Hindsight in Credit Assignmentcited by 16
  11. 2019Disentangled Cumulants Help Successor Representations Transfer to New Taskscited by 11
  12. 2017Advantages and Limitations of using Successor Features for Transfer in Reinforcement Learningcited by 10
  13. 2021Successor Feature Sets: Generalizing Successor Representations Across Policiescited by 6

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Long-Horizon Q-Learning: Accurate Value Learning via n-Step Inequalities
  2. 2026Latent Representation Alignment for Offline Goal-Conditioned Reinforcement Learning
  3. 2026Horizon Adaptive Offline Policy Learning via Value Stitching
  4. 2025Use the Online Network If You Can: Towards Fast and Stable Reinforcement Learning
  5. 2026GTRL: Grounding Divide-and-Conquer Value Learning with Temporal Differences
  6. 2025Flattening Hierarchies with Policy Bootstrapping
  7. 2025Pretrain Value, Not Reward: Decoupled Value Policy Optimization
  8. 2025Option-aware Temporally Abstracted Value for Offline Goal-Conditioned Reinforcement Learning