Adaptive Pairwise Weights for Temporal Credit Assignment
Not on the map. Why?
Abstract (arXiv)
How much credit (or blame) should an action taken in a state get for a future reward? This is the fundamental temporal credit assignment problem in Reinforcement Learning (RL). One of the earliest and still most widely used heuristics is to assign this credit based on a scalar coefficient, λ (treated as a hyperparameter), raised to the power of the time interval between the state-action and the reward. In this empirical paper, we explore heuristics based on more general pairwise weightings that are functions of the state in which the action was taken, the state at the time of the reward, as well as the time interval between the two. Of course it isn't clear what these pairwise weight functions should be, and because they are too complex to be treated as hyperparameters we develop a metagradient procedure for learning these weight functions during the usual RL training of a policy. Our empirical work shows that it is often possible to learn these pairwise weight functions during learning of the policy to achieve better performance than competing approaches.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 17 of its 28 references that are in the map. First posted on arXiv 9 Feb 2021.
Builds on
17 of 28 references.
References · 17
- 2017Attention Is All You Needcited by 60,361
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,333
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
- 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
- 2018RUDDER: Return Decomposition for Delayed Rewardscited by 173
- 2019Behaviour Suite for Reinforcement Learningcited by 132
- 2018On Learning Intrinsic Rewards for Policy Gradient Methodscited by 102
- 2019Hindsight Credit Assignmentcited by 79
- 2020Discovering Reinforcement Learning Algorithmscited by 77
- 2020Counterfactual Credit Assignment in Model-Free Reinforcement Learningcited by 64
- 2018Optimizing Agent Behavior over Long Time Scales by Transporting Valuecited by 58
5 more
- 2020Meta-Gradient Reinforcement Learning with an Objective Discovered Onlinecited by 52
- 2019Discovery of Useful Questions as Auxiliary Taskscited by 45
- 2019What Can Learned Intrinsic Rewards Capture?cited by 36
- 2020Expected Eligibility Tracescited by 27
- 2019Beyond Exponentially Discounted Sum: Automatic Learning of Return Functioncited by 7
Built on by
Citing papers per year: 2023: 2.
2 papers.