Single-Agent Policy Tree Search With Guarantees

We introduce two novel tree search algorithms that use a policy to guide search. The first algorithm is a best-first enumeration that uses a cost function that allows us to prove an upper bound on the number of nodes to be expanded before reaching a goal state... (read more)

PDF Abstract NeurIPS 2018 PDF NeurIPS 2018 Abstract

Tasks


Datasets


  Add Datasets introduced or used in this paper

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper


METHOD TYPE
Entropy Regularization
Regularization
Convolution
Convolutions
Dense Connections
Feedforward Networks
Softmax
Output Functions
A3C
Policy Gradient Methods