153 citations · 360 across the 23 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2019★ 1 cited
Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees
Laurent Orseau, Levi H. S. Lelis, Tor Lattimore
We introduce and analyze two parameter-free linear-memory tree search algorithms. Under mild assumptions we prove our algorithms are guaranteed to perform only a logarithmic factor…
cs.AI2018
Single-Agent Policy Tree Search With Guarantees
Laurent Orseau, Levi H. S. Lelis, Tor Lattimore +1
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 a…