Leveraging Language to Learn Program Abstractions and Search Heuristics
Catherine Wong, Kevin Ellis, Joshua B. Tenenbaum, Jacob Andreas
Abstract
Inductive program synthesis, or inferring programs from examples of desired behavior, offers a general paradigm for building interpretable, robust, and generalizable machine learning systems. Effective program synthesis depends on two key ingredients: a strong library of functions from which to build programs, and an efficient search strategy for finding programs that solve a given task. We introduce LAPS (Language for Abstraction and Program Search), a technique for using natural language annotations to guide joint learning of libraries and neurally-guided search models for synthesis. When integrated into a state-of-the-art library learning system (DreamCoder), LAPS produces higher-quality libraries and improves search efficiency and generalization on three domains -- string editing, image composition, and abstract reasoning about scenes -- even when no natural language hints are available at test time.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b66a1445-13b8-401e-9e9f-17ca497ea40fCited by top-tier papers22
- Large Language Models are Human-Level Prompt EngineersYongchao Zhou, Andrei Ioan Muresanu, Ziwen Han, Keiran Paster et al.ICLR 2023 · 297 citations
- Skill Induction and Planning with Latent LanguagePratyusha Sharma, Antonio Torralba, Jacob AndreasACL 2022 · 127 citations
- Symbolic Regression with a Learned Concept LibraryArya Grayeli, Atharva Sehgal, Omar Costilla-Reyes, Miles D. Cranmer et al.NeurIPS 2024 · 105 citations
- Learning to Synthesize Programs as Interpretable and Generalizable PoliciesDweep Trivedi, Jesse Zhang, Shao-Hua Sun, Joseph J. LimNeurIPS 2021 · 104 citations
- TroVE: Inducing Verifiable and Efficient Toolboxes for Solving Programmatic TasksZhiruo Wang, Graham Neubig, Daniel FriedICML 2024 · 47 citations
Builds on4
- Few-Shot Bayesian Imitation Learning with Logical Program PoliciesTom Silver, Kelsey R. Allen, Alex K. Lew, Leslie Pack Kaelbling et al.AAAI 2020 · 57 citations
- Learning abstract structure for drawing by efficient motor program inductionLucas Yanan Tian, Kevin Ellis, Marta Kryven, Josh TenenbaumNeurIPS 2020 · 47 citations
- Mutual exclusivity as a challenge for deep neural networksKanishk Gandhi, Brenden M. LakeNeurIPS 2020 · 31 citations
- Benchmarking Multimodal Regex Synthesis with Complex StructuresXi Ye, Qiaochu Chen, Isil Dillig, Greg DurrettACL 2020 · 13 citations
Related papers
- Bayesian Program Learning by Decompiling Amortized KnowledgeAlessandro B. Palmarini, Christopher G. Lucas, N. SiddharthICML 2024 · 2 citations
- DreamCoder: bootstrapping inductive program synthesis with wake-sleep library learningKevin Ellis, Catherine Wong, Maxwell I. Nye, Mathias Sablé-Meyer et al.PLDI 2021 · 97 citations
- Top-Down Synthesis for Library LearningMatthew Bowers, Theo X. Olausson, Lionel Wong, Gabriel Grand et al.POPL 2023 · 32 citations
- LILO: Learning Interpretable Libraries by Compressing and Documenting CodeGabriel Grand, Lionel Wong, Matthew Bowers, Theo X. Olausson et al.ICLR 2024 · 35 citations
- HYSYNTH: Context-Free LLM Approximation for Guiding Program SynthesisShraddha Barke, Emmanuel Anaya Gonzalez, Saketh Ram Kasibatla, Taylor Berg-Kirkpatrick et al.NeurIPS 2024 · 34 citations
