117 citations · 278 across the 28 of their papers we have counts for
4 papers · 1 filter
Iterative Budgeted Exponential Search
Malte Helmert, Tor Lattimore, Levi H. S. Lelis +2
We tackle two long-standing problems related to re-expansions in heuristic search algorithms. For graph search, A* can require expansions, where is the number of sta…
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…
Soft-Bayes: Prod for Mixtures of Experts with Log-Loss
Laurent Orseau, Tor Lattimore, Shane Legg
We consider prediction with expert advice under the log-loss with the goal of deriving efficient and robust algorithms. We argue that existing algorithms such as exponentiated grad…
An investigation of model-free planning
Arthur Guez, Mehdi Mirza, Karol Gregor +10
The field of reinforcement learning (RL) is facing increasingly challenging domains with combinatorial complexity. For an RL agent to address these challenges, it is essential that…