2 citations · 2 across the 8 of their papers we have counts for
8 papers
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…
Gradient-Based Program Synthesis with Neurally Interpreted Languages
Matthew V. Macfarlane, Clément Bonnet, Herke van Hoof +1
A central challenge in program induction has long been the trade-off between symbolic and neural approaches. Symbolic methods offer compositional generalisation and data efficiency…
Common Benchmarks Undervalue the Generalization Power of Programmatic Policies
Amirhossein Rajabpour, Kiarash Aghakasiri, Sandra Zilles +1
Algorithms for learning programmatic representations for sequential decision-making problems are often evaluated on out-of-distribution (OOD) problems, with the common conclusion t…
Subgoal-Guided Policy Heuristic Search with Learned Subgoals
Jake Tuero, Michael Buro, Levi H. S. Lelis
Policy tree search is a family of tree search algorithms that use a policy to guide the search. These algorithms provide guarantees on the number of expansions required to solve a…
InnateCoder: Learning Programmatic Options with Foundation Models
Rubens O. Moraes, Quazi Asif Sadmine, Hendrik Baier +1
Outside of transfer learning settings, reinforcement learning agents start their learning process from a clean slate. As a result, such agents have to go through a slow process to…
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…
Searching for Programmatic Policies in Semantic Spaces
Rubens O. Moraes, Levi H. S. Lelis
Syntax-guided synthesis is commonly used to generate programs encoding policies. In this approach, the set of programs, that can be written in a domain-specific language defines th…
Assessing the Interpretability of Programmatic Policies with Large Language Models
Zahra Bashir, Michael Bowling, Levi H. S. Lelis
Although the synthesis of programs encoding policies often carries the promise of interpretability, systematic evaluations were never performed to assess the interpretability of th…