TY - GEN
T1 - Counterfactual Credit Assignment in Model-Free Reinforcement Learning
AU - Mesnard, Thomas
AU - Weber, Théophane
AU - Viola, Fabio
AU - Thakoor, Shantanu
AU - Saade, Alaa
AU - Harutyunyan, Anna
AU - Dabney, Will
AU - Stepleton, Tom
AU - Heess, Nicolas
AU - Guez, Arthur
AU - Moulines, Éric
AU - Hutter, Marcus
AU - Buesing, Lars
AU - Munos, Rémi
N1 - Publisher Copyright:
Copyright © 2021 by the author(s)
PY - 2021/1/1
Y1 - 2021/1/1
N2 - Credit assignment in reinforcement learning is the problem of measuring an action's influence on future rewards. In particular, this requires separating skill from luck, i.e. disentangling the effect of an action on rewards from that of external factors and subsequent actions. To achieve this, we adapt the notion of counterfactuals from causality theory to a model-free RL setup. The key idea is to condition value functions on future events, by learning to extract relevant information from a trajectory. We formulate a family of policy gradient algorithms that use these future-conditional value functions as baselines or critics, and show that they are provably low variance. To avoid the potential bias from conditioning on future information, we constrain the hindsight information to not contain information about the agent's actions. We demonstrate the efficacy and validity of our algorithm on a number of illustrative and challenging problems.
AB - Credit assignment in reinforcement learning is the problem of measuring an action's influence on future rewards. In particular, this requires separating skill from luck, i.e. disentangling the effect of an action on rewards from that of external factors and subsequent actions. To achieve this, we adapt the notion of counterfactuals from causality theory to a model-free RL setup. The key idea is to condition value functions on future events, by learning to extract relevant information from a trajectory. We formulate a family of policy gradient algorithms that use these future-conditional value functions as baselines or critics, and show that they are provably low variance. To avoid the potential bias from conditioning on future information, we constrain the hindsight information to not contain information about the agent's actions. We demonstrate the efficacy and validity of our algorithm on a number of illustrative and challenging problems.
UR - https://www.scopus.com/pages/publications/85161276343
M3 - Conference contribution
AN - SCOPUS:85161276343
T3 - Proceedings of Machine Learning Research
SP - 7654
EP - 7664
BT - Proceedings of the 38th International Conference on Machine Learning, ICML 2021
PB - ML Research Press
T2 - 38th International Conference on Machine Learning, ICML 2021
Y2 - 18 July 2021 through 24 July 2021
ER -