REVIEW 2 cited by
Diffusion On Syntax Trees For Program Synthesis
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Large language models generate code one token at a time. Their autoregressive generation process lacks the feedback of observing the program's output. Training LLMs to suggest edits directly can be challenging due to the scarcity of rich edit data. To address these problems, we propose neural diffusion models that operate on syntax trees of any context-free grammar. Similar to image diffusion models, our method also inverts ``noise'' applied to syntax trees. Rather than generating code sequentially, we iteratively edit it while preserving syntactic validity, which makes it easy to combine this neural model with search. We apply our approach to inverse graphics tasks, where our model learns to convert images into programs that produce those images. Combined with search, our model is able to write graphics programs, see the execution result, and debug them to meet the required specifications. We additionally show how our system can write graphics programs for hand-drawn sketches.
Forward citations
Cited by 2 Pith papers
-
Beyond the Autoregressive Horizon: A Comprehensive Survey of Diffusion Models, World Modelling, and State Space Models for Code
A survey of diffusion, world-model, and state-space architectures for code that frames them as routes past autoregressive bottlenecks toward System-2 coding agents.
-
Capturing Sparks of Abstraction for the ARC Challenge
An LLM is prompted with correct ARC solutions in a redesigned DSL to produce comments, refactored functions, high-level tactics, and step descriptions, and the resulting data is released openly.
Discussion (0). Continue with ORCID to comment.