117 citations · 141 across the 14 of their papers we have counts for
8 papers · 1 filter
From AGI to ASI
Tim Genewein, Matija Franklin, Alexander Lerchner +11
Over the last decade, building human-level artificial general intelligence has moved from far-fetched speculation to being a concrete next-decade target for many of the largest AI…
Structure-Induced Information for Rerooting Levin Tree Search
Jake Tuero, Michael Buro, Laurent Orseau +1
Subgoal-based policy tree search, which uses a policy to guide search, is effective for complex single-agent deterministic problems but often relies on explicit subgoal generation…
Exponential Speedups by Rerooting Levin Tree Search
Laurent Orseau, Marcus Hutter, Levi H. S. Lelis
Levin Tree Search (LTS) (Orseau et al., 2018) is a search algorithm for deterministic environments that uses a user-specified policy to guide the search. It comes with a formal gua…
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
Abbas Mehrabian, Ankit Anand, Hyunjik Kim +16
This work studies a central extremal graph theory problem inspired by a 1975 conjecture of Erdős, which aims to find graphs with a given size (number of nodes) that maximize the nu…
Training a First-Order Theorem Prover from Synthetic Data
Vlad Firoiu, Eser Aygun, Ankit Anand +6
A major challenge in applying machine learning to automated theorem proving is the scarcity of training data, which is a key ingredient in training successful deep learning models.…
Policy-Guided Heuristic Search with Guarantees
Laurent Orseau, Levi H. S. Lelis
The use of a policy and a heuristic function for guiding search can be quite effective in adversarial problems, as demonstrated by AlphaGo and its successors, which are based on th…