REVIEW 1 cited by
Synthetic Datasets for Neural 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
read the original abstract
The goal of program synthesis is to automatically generate programs in a particular language from corresponding specifications, e.g. input-output behavior. Many current approaches achieve impressive results after training on randomly generated I/O examples in limited domain-specific languages (DSLs), as with string transformations in RobustFill. However, we empirically discover that applying test input generation techniques for languages with control flow and rich input space causes deep networks to generalize poorly to certain data distributions; to correct this, we propose a new methodology for controlling and evaluating the bias of synthetic data distributions over both programs and specifications. We demonstrate, using the Karel DSL and a small Calculator DSL, that training deep networks on these distributions leads to improved cross-distribution generalization performance.
Forward citations
Cited by 1 Pith paper
-
Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer
Solver-aware training of a PBE decomposer with a frozen synthesizer's loss outperforms supervised imitation of ground-truth subgoals, solving tasks that a ground-truth decomposition oracle fails.
Discussion (0). Sign in to comment.