Synthesizing world models for bilevel planning
TLDR
TheoryCoder synthesizes hierarchical world models via program synthesis for bilevel planning in grid-world games, improving sample efficiency.
Reasoning
Strengths include a novel integration of program synthesis with hierarchical world models for planning, addressing limitations of prior TBRL systems. Weaknesses are the restriction to grid-world domains and lack of real-world evaluation, leaving scalability and generality unverified.
Read-first score
Read-first score 52.6, weighted from topical fit, citation, graph, method, reproducibility, and recency signals. Original total remains 35.
Field roles
Rank sensitivity
Stability: volatile; rank range: 322.
Keyword Scores
Deep Analysis
Innovations
- TheoryCoder, an instantiation of TBRL that uses hierarchical representations of theories and efficient program synthesis methods
- Grounding general-purpose abstractions (e.g., 'move to') by learning low-level transition models as Python programs synthesized from observations by a large language model
- A bilevel planning algorithm that exploits hierarchical structure to solve large domains
Methodology
TheoryCoder equips agents with hierarchical abstractions (e.g., 'move to') that are grounded in a particular environment by learning a low-level transition model, which is a Python program synthesized from observations by a large language model. A bilevel planning algorithm then exploits this hierarchical structure to perform planning in large domains. The approach is evaluated on diverse and challenging grid-world games, with baselines including direct policy synthesis.
Key Results
TheoryCoder is successfully applied to diverse and challenging grid-world games, where approaches based on directly synthesizing a policy perform poorly. Ablation studies demonstrate the benefits of using hierarchical abstractions.