atlas

Research map / Large language models / Agents, code and math

Generating Pragmatic Examples to Train Neural Program Synthesizers

ICLR 2024 · Large language models › Agents, code and math · approach: Neural program synthesis and transpilation · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes PraX, which bootstraps a pragmatic neural programming-by-example synthesizer by self-play between neural speaker and listener models with RSA inference used to select informative training examples, requiring no human data.

Problem

Programming-by-example is ambiguous: many programs are consistent with a given set of input-output examples, and exact pragmatic (RSA) reasoning over program and example spaces is intractable for realistic domains like regular expressions.

Approach

Amortize RSA pragmatic inference into neural speaker and listener models by using RSA over sampled consistency matrices to pick informative examples during self-play, then iteratively fine-tune both models on the generated data without human supervision.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Train with self-play and RSA-selected pragmatic examples instead of randomly chosen examplesByT5-small regular-expression synthesizer · Regular-expression user study, 10 turnsTop-1@10: 0.434 -> 0.661Helped
Train with self-play and RSA-selected pragmatic examples instead of randomly chosen examplesByT5-small regular-expression synthesizer · Regular-expression user study, averaged over 10 turnsTop-1: 0.233 -> 0.373Helped
Use self-play and RSA-generated examples rather than fine-tuning on human-provided examplesByT5-small regular-expression synthesizer · Regular-expression user study, 10 turnsTop-1@10: 0.587 -> 0.661Helped
Use self-play and RSA-generated examples rather than fine-tuning on human-provided examplesByT5-small regular-expression synthesizer · Regular-expression user study, averaged over 10 turnsTop-1: 0.349 -> 0.373No clear effect
Use gpt-3.5 instead of the literal synthesizerRegular-expression synthesizer · Regular-expression user study, 10 turnsTop-1@10: 0.434 -> 0.074Hurt
Iteratively generate data and update the model rather than generating data and updating only oncePraX regular-expression synthesizer · Regular-expression user study replayTop-1Helped

Surprising findings

Limitations

Experimental setup

Datasets: Synthetic regex program-specification pairs sampled from Ye et al. templates Human-provided regex specifications (440 collected; 400 train, 40 validation)

Benchmarks: Regex programming-by-example user study (11 participants, 340 regexes)

Metrics: Top-1@10 Top-10@10 Edit Distance <=1@10 average Top-1 over turns

Baselines: Literal listener HFT (fine-tuned on human-provided specifications) GPT-3.5

Builds on: Rational Speech Acts Pragmatic program synthesis (cooperative game framework) ByT5

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy