117 citations · 137 across the 7 of their papers we have counts for
13 papers
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…
Avoiding Side Effects By Considering Future Tasks
Victoria Krakovna, Laurent Orseau, Richard Ngo +2
Designing reward functions is difficult: the designer has to specify what to do (what it means to complete the task) as well as what not to do (side effects that should be avoided…
Learning to Prove from Synthetic Theorems
Eser Aygün, Zafarali Ahmed, Ankit Anand +5
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.…
Logarithmic Pruning is All You Need
Laurent Orseau, Marcus Hutter, Omar Rivasplata
The Lottery Ticket Hypothesis is a conjecture that every large neural network contains a subnetwork that, when trained in isolation, achieves comparable performance to the large ne…
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…