Name
Abstract | ||
|---|---|---|
We consider the problem of efficient credit assignment in reinforcement learning. In order to efficiently and meaningfully utilize new data, we propose to explicitly assign credit to past decisions based on the likelihood of them having led to the observed outcome. This approach uses new information in hindsight, rather than employing foresight. Somewhat surprisingly, we show that value functions can be rewritten through this lens, yielding a new family of algorithms. We study the properties of these algorithms, and empirically show that they successfully address important credit assignment challenges, through a set of illustrative tasks. |
Year | Venue | DocType |
|---|---|---|
2019 | NeurIPS | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
12 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anna Harutyunyan | 1 | 85 | 9.63 |
| William Dabney | 2 | 270 | 17.86 |
| Thomas Mesnard | 3 | 0 | 0.68 |
| Mohammad Gheshlaghi Azar | 4 | 238 | 15.60 |
| Bilal Piot | 5 | 335 | 20.65 |
| Nicolas Heess | 6 | 1762 | 94.77 |
| hado van hasselt | 7 | 432 | 31.39 |
| Greg Wayne | 8 | 592 | 31.86 |
| Satinder P. Singh | 9 | 5508 | 715.52 |
| Doina Precup | 10 | 2829 | 221.83 |
| Rémi Munos | 11 | 2240 | 157.06 |
| van Hasselt, Hado P. | 12 | 0 | 0.34 |