Name
Abstract | ||
|---|---|---|
Sequential decision making problems, such as structured prediction, robotic control, and game playing, require a combination of planning policies and generalisation of those plans. In this paper, we present Expert Iteration (EXIT), a novel reinforcement learning algorithm which decomposes the problem into separate planning and generalisation tasks. Planning new policies is performed by tree search, while a deep neural network generalises those plans. Subsequently, tree search is improved by using the neural network policy to guide search, increasing the strength of new plans. In contrast, standard deep Reinforcement Learning algorithms rely on a neural network not only to generalise plans, but to discover them too. We show that EXIT outperforms REINFORCE for training a neural network to play the board game Hex, and our final tree search agent, trained tabula rasa, defeats MOHEX 1.0, the most recent Olympiad Champion player to be publicly released. |
Year | Venue | DocType |
|---|---|---|
2017 | ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017) | Conference |
Volume | ISSN | Citations |
30 | 1049-5258 | 21 |
PageRank | References | Authors |
0.99 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anthony, Thomas | 1 | 23 | 3.03 |
| Tian Zheng | 2 | 63 | 8.01 |
| David Barber | 3 | 404 | 45.57 |