Cited by 105Evolutionary Algorithms and ApplicationsAI-based Problem Solving and PlanningTeaching and Learning Programming

DreamCoder: bootstrapping inductive program synthesis with wake-sleep library learning

Open access
Ellis, Kevin, Wong, Catherine, Nye, Maxwell, Sablé-Meyer, Mathias, Morales, Lucas, Hewitt, Luke, Cary, Luc, Solar-Lezama, Armando +1 more·2021·Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation

Abstract

We present a system for inductive program synthesis called DreamCoder, which inputs a corpus of synthesis problems each specified by one or a few examples, and automatically derives a library of program components and a neural search policy that can be used to efficiently solve other similar synthesis problems. The library and search policy bootstrap each other iteratively through a variant of "wake-sleep" approximate Bayesian learning. A new refactoring algorithm based on E-graph matching identifies common sub-components across synthesized programs, building a progressively deepening library of abstractions capturing the structure of the input domain. We evaluate on eight domains including classic program synthesis areas and AI tasks such as planning, inverse graphics, and equation discovery. We show that jointly learning the library and neural search policy leads to solving more problems, and solving them more quickly.

Integrity signals

Registry

Crossref · 10.1145/3453483.3454080

Cites

55 of 55 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • An external generative model that created dream-like input helped train a DNN to produce the code behind a given mathematical mapping.

    “Indeed, recently an external generative model that created “dream-like” input helped train a DNN to produce the code behind a given mathematical mapping.148”

    From The overfitted brain: Dreams evolved to assist generalization (2021) · cites this paper as [148]

  • The evidence for the possibility that dreams improve performance comes from common methods in deep learning that improve generalization, such as dropout, domain randomization, and the use of input data created by stochastic stimulation of generative models, which together bear striking similarities to the properties of dreams.

    “The evidence for this possibility comes from common methods in deep learning that improve generalization, such as dropout,126 domain randomization,144 and the use of input data created by stochastic stimulation of generative models,148 which together bear striking similarities to the properties of dreams.”

    From The overfitted brain: Dreams evolved to assist generalization (2021) · cites this paper as [148]

Cites

Flagged first, then by citations

1 of the 56 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Ellis, K., Wong, C., Nye, M., Sablé-Meyer, M., Morales, L., Hewitt, L., Cary, L., Solar-Lezama, A., & Tenenbaum, J. B.
Affiliations
  • Cornell University (US)
  • Massachusetts Institute of Technology (US)
  • Collège de France (FR)
Venue
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation
Publisher
ACM
Published
2021-06-18
Pages
835-850
ISSN
1531-7102 (ISSN-L)
OpenAlex
W3174357804
Cited by
103
References
56
Citations by year
2026: 14 · 2025: 24 · 2024: 18 · 2023: 30 · 2022: 10 · 2021: 7
FWCI
7.51
Type
conference paper
Language
en
Open access
Locations
  • ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (publishedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
Funders
  • National Science Foundation (1918839 and 1231216)
  • Air Force Office of Scientific Research (FA9550-16-1-0012)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
  • Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
Keywords
inductive program synthesis, bootstrapping, refactoring, program abstraction, planning, inverse graphics, equation discovery

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review