Learning to Synthesize Programs as Interpretable and Generalizable Policies
By Dweep Trivedi, Jesse Zhang, Shao-Hua Sun, Joseph J. Lim. 2021
96 citations recorded by the source corpus.
Recently, deep reinforcement learning (DRL) methods have achieved impressive performance on tasks in a variety of domains. However, neural network policies produced with DRL methods are not human-interpretable and often have difficulty generalizing to novel scenarios. To address these issues, prior works explore learning programmatic policies that are more interpretable and structured for generalization. Yet, these works either employ limited policy representations (e.g. decision trees, state machines, or predefined program templates) or require stronger supervision (e.g. input/output state pairs or expert demonstrations). We present a framework that instead learns to synthesize a program, which details the procedure to solve a task in a flexible and expressive manner, solely from reward signals. To alleviate the difficulty of learning to compose programs to induce the desired agent behavior from scratch, we propose to first learn a program embedding space that continuously parameterizes diverse behaviors in an unsupervised manner and then search over the learned program embedding space to yield a program that maximizes the return for a given task. Experimental results demonstrate that the proposed framework not only learns to reliably synthesize task-solving programs but also outperforms DRL and program synthesis baselines while producing interpretable and more generalizable policies. We also justify the necessity of the proposed two-stage learning scheme as well as analyze various methods for learning the program embedding.
Subfields: Artificial Intelligence, Reinforcement Learning
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Sergey Levine
- Pieter Abbeel
- Yoshua Bengio
- Ruslan Salakhutdinov
- Mohit Bansal
- Quoc V. Le
- Chelsea Finn
- Jianfeng Gao
In Reinforcement Learning
- Sergey Levine
- Pieter Abbeel
- Nicolas Manfred Otto Heess
- Yuxi Li
- Shimon Whiteson
- Chelsea Finn
- Timothy P. Lillicrap
- Shixiang Shane Gu
Citations in the corpus
- Competition-level code generation with AlphaCode (2022, background): “, 2017), or even generate programmatic policies in reinforcement learning settings (Trivedi et al., 2021).”
- Language to Rewards for Robotic Skill Synthesis (2023, background): “The capability of those models range from solving coding competition questions [38] and benchmarks [39], to drawing simple figures [40], generating policies that solve 2D tasks [41], and complex instruction following tasks [3].”
- A Real-World WebAgent with Planning, Long Context Understanding, and Program Synthesis (2023, background): “Most works deal with the program synthesis on the static dataset, except for the attempts in robotics (Liang et al., 2023) and game (Trivedi et al., 2022; Wang et al., 2023a), where LLMs output Python or JavaScript snippets to command the agents.”
- Mechanistic Interpretability for AI Safety - A Review (2024, background): “Some key distinctions are drawn between global versus local interpretability and comprehensive versus partial interpretability.”