arrow
Return

DreamCoder: growing generalizable, interpretable knowledge with wake-sleep Bayesian program learning

delete2023-06-05
delete16
delete
OA
AI
K
Kevin Ellis *
L
Lionel Wong
M
Maxwell Nye
M
Mathias Sablé-Meyer
L
Luc Cary
L
Lore Anaya Pozo
L
Luke Hewitt
A
Armando Solar-Lezama
J
Joshua B. Tenenbaum
DOI:10.1098/rsta.2022.0050delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Expert problem-solving is driven by powerful languages for thinking about problems and their solutions. Acquiring expertise means learning these languages-systems of concepts, alongside the skills to use them. We present DreamCoder, a system that learns to solve problems by writing programs. It builds expertise by creating domain-specific programming languages for expressing domain concepts, together with neural networks to guide the search for programs within these languages. A 'wake-sleep' learning algorithm alternately extends the language with new symbolic abstractions and trains the neural network on imagined and replayed problems. DreamCoder solves both classic inductive programming tasks and creative tasks such as drawing pictures and building scenes. It rediscovers the basics of modern functional programming, vector algebra and classical physics, including Newton's and Coulomb's laws. Concepts are built compositionally from those learned earlier, yielding multilayered symbolic representations that are interpretable and transferrable to new tasks, while still growing scalably and flexibly with experience.This article is part of a discussion meeting issue 'Cognitive artificial intelligence'.
Keywords:
program synthesis
expertise
Bayesian program learning

Journal

P
Philosophical Transactions of the Royal Society A-Mathematical Physical and Engineering Sciences
IF:
3.7
Papers:
7.7K
Citations:
2.8W

Organization

C
college de france
Scholars:
2.1K
Papers: 1.5K
Citations: 3
U
Universite PSL
Scholars:
3.3W
Papers: 2.5W
Citations: 91