PaperlayerView exact revision on arXiv

Source-linked AI summary

RobustFill: Neural Program Learning under Noisy I/O

Jacob Devlin, Jonathan Uesato, Surya Bhupatiraju, Rishabh Singh, Abdel-rahman Mohamed, Pushmeet Kohli

arXiv:1703.07469v1cs.AI

TL;DR

The paper addresses how neural systems should learn programs or outputs from I/O examples in realistic string-transformation tasks. It develops an attentional-RNN-based synthesis system and directly compares synthesis, induction, and rule-based approaches. The synthesis model reaches 92% accuracy, remains robust to noisy examples, and the comparison shows that approach strengths depend on evaluation conditions.

  • Problem

    The work addresses limited direct evidence comparing neural program synthesis and induction on a large real-world task, alongside rule-based synthesis under noisy I/O examples.

    Source: §1 · pp. 1–2

  • Method

    The paper uses modified attentional RNNs to encode variable-sized I/O-example sets and generates either programs in a string-transformation DSL or output strings directly.

    Source: §4 · p. 4

  • Results

    92% accuracy on a real-world FlashFill test set matches a hand-engineered system and exceeds the previous-best neural synthesis model by 58%.

    Source: §8 · p. 8

  • Takeaways & Limitations

    Synthesis performs better on this task, while synthesis and induction each have strengths under different evaluation metrics and decoding constraints.

    Source: §1 · p. 2, §8 · p. 9

    A richer DSL representation increased the search space by 10x, and hierarchical representation was not retained because its value did not justify computational cost.

    Source: §4.1 · p. 4, §5.2 · p. 6

Abstract

from arXiv · show

The problem of automatically generating a computer program from some specification has been studied since the early days of AI. Recently, two competing approaches for automatic program learning have received significant attention: (1) neural program synthesis, where a neural network is conditioned on input/output (I/O) examples and learns to generate a program, and (2) neural program induction, where a neural network generates new outputs directly using a latent program representation. Here, for the first time, we directly compare both approaches on a large-scale, real-world learning task. We additionally contrast to rule-based program synthesis, which uses hand-crafted semantics to guide the program generation. Our neural models use a modified attention RNN to allow encoding of variable-sized sets of I/O pairs. Our best synthesis model achieves 92% accuracy on a real-world test set, compared to the 34% accuracy of the previous best neural synthesis approach. The synthesis model also outperforms a comparable induction model on this task, but we more importantly demonstrate that the strength of each approach is highly dependent on the evaluation metric and end-user application. Finally, we show that we can train our neural models to remain very robust to the type of noise expected in real-world data (e.g., typos), while a highly-engineered rule-based system fails entirely.

1. Introduction

RobustFill examines neural program synthesis and induction for noisy, real-world string transformations, directly comparing them with rule-based synthesis. It introduces a neural architecture for variable-sized I/O example sets and reports stronger accuracy and noise robustness than prior statistical and hand-engineered approaches.

  • Program learning generates programs from specifications, but hand-engineered synthesis systems are difficult to extend and fragile to noise.Source: §1 · p. 1
  • The paper directly contrasts neural program synthesis, which generates programs from I/O examples, with neural induction, which generates outputs using a latent program representation.Source: §1 · pp. 1–2
  • FlashFill-style string transformation lets users provide a few output examples while the system generates outputs for remaining input strings.Source: §1 · p. 2
  • The models use modified attentional RNNs to encode variable-sized sets of I/O examples and generate either a DSL program or an output string.Source: §1 · p. 2
  • 92% accuracy on 205 real-world FlashFill instances substantially exceeds the previous best statistical system’s 34% accuracy.Source: §1 · p. 2
  • With noise, the model achieves 80% accuracy versus 6% for the comparable clean-data-performing system, while neural and induction approaches show different metric-dependent strengths.Source: §1 · p. 2

2. Related Work

Related work spans neural induction, neural synthesis, and DSL-based rule-guided synthesis. RobustFill differs by learning an end-to-end synthesis algorithm rather than relying on hand-coded search guidance.

Neural Program Induction

  • Neural program induction uses latent memory or controller representations to generate outputs for algorithmic tasks.Source: §2 · p. 2

Neural Program Synthesis

  • Neural program synthesis generates or searches for programs from examples, with RobustFill performing end-to-end synthesis unlike DeepCoder’s externally augmented search.Source: §2 · p. 2

DSL-based synthesis

  • DSL-based synthesis exploits operator independence with divide-and-conquer search, hand-crafted pruning, and ranking heuristics.Source: §2 · p. 2
  • RobustFill presents a neural architecture that automatically learns an efficient synthesis algorithm, unlike approaches requiring hand-coded textual features.Source: §2 · p. 3

3. Problem Overview

The task asks a system to generalize string transformations from observed I/O examples to assessment inputs, either by synthesizing a program or directly inducing outputs. RobustFill uses a rich DSL and evaluates exact generalization on real-world FlashFill instances.

3.1. Problem Formulation

  • Given observed I/O pairs and unpaired assessment inputs, the system must generate the corresponding assessment output strings.Source: §3.1 · p. 3
  • Each instance assumes at least one program correctly transforms all observed and assessment examples, although multiple valid programs may exist.Source: §3.1 · p. 3
  • Synthesis generates a DSL program token-by-token and can execute candidates on observed inputs to check consistency before searching further.Source: §3.1 · p. 3
  • Consistency on observed examples is necessary but does not guarantee generalization to new assessment examples.Source: §3.1 · p. 3
  • Induction generates assessment outputs character-by-character from observed examples and the assessment input, without explicitly using program P.Source: §3.1 · p. 3
  • Generalization accuracy requires every assessment output to be exactly correct; evaluation typically uses four observed and six assessment examples.Source: §3.1 · p. 3

3.2. The Domain Specific Language

  • The DSL represents string transformations through substring extraction, conversions, constants, nested expressions, and regex-based extraction.Source: §3.2 · pp. 3–4
  • Approximately 30 million unique string expressions make pruning essential because black-box search must otherwise examine many candidates.Source: §3.2 · p. 4

4. Program Synthesis Model Architecture

The model treats program synthesis as sequence-to-sequence generation, encoding I/O examples with recurrent networks and generating program tokens sequentially. Its architecture evolves from basic encoding toward attention, double attention, bidirectional processing, and late pooling for unordered variable-sized example sets.

Single-Example Representation

  • Program synthesis is formulated as sequence-to-sequence generation, with RNNs encoding observed I/O and another RNN generating the program token by token.The program is represented as a sequential output rather than a hierarchical RNN.Source: §4 · p. 4, §4.1 · p. 4
  • The study explores four increasingly complex architectures: Basic Seq-to-Seq, Attention-A, Attention-B, and Attention-C.The variants progressively introduce attention, double attention, and bidirectional LSTMs.Source: §4.1 · pp. 4–5

Double Attention

  • Attention-A lets the output representation attend to the input, while Attention-B adds simultaneous attention to both output and input representations.In Attention-A, O attends to I and P attends to O; Attention-B gives P double attention to O and I.Source: §4.1 · pp. 4–5

Implementation

  • The implementation uses character-level I/O representations and source-code-order program tokens, with 95 printable ASCII tokens for strings and 430 program tokens.Training uses 512-unit recurrent and fully connected layers, 128-dimensional embeddings, SGD with gradient clipping, and 2 million minibatch updates.Source: §4.1 · p. 5, §4.4 · pp. 5–6

Double Attention

  • Double attention computes attention over two vector sets using the previous recurrent state and current input, with the first attention influencing computation of the second.The paper specifies S, h_i−1, and x_i as the attended vectors, previous state, and current input; in the double-attention setup, S_A is O and S_B is I.Source: §4.2 · p. 5

Multi-Example Pooling

  • Because test instances contain unordered, variable numbers of I/O examples, the model uses late pooling across example-specific hidden states at each timestep.Each example has separate I, O, and P layers with shared weights; pooled P states feed one output softmax layer.Source: §4.3 · p. 5
  • The pooling and output layers apply max pooling after a learned transformation, then softmax over the program vocabulary.The pooled representation is m_i, and y_i is the softmax output over v program tokens.Source: §4.3 · p. 5

5. Program Synthesis Results

The synthesis results show that attention-based architectures and constrained decoding substantially improve generalization, with the best model reaching 92% accuracy. Generalization rises with more observed examples, while consistency and decoder behavior reveal remaining limitations.

Consistency vs. Generalization

  • Generalization accuracy requires a consistent program that produces exactly correct outputs for all six assessment examples.The reported percentage is the proportion of test instances meeting both conditions.Source: §5 · p. 6

Architecture and Decoding

  • 25% absolute improvement separates all attentional variants from the basic seq-to-seq model.Attention-B and Attention-C add roughly 2–5% absolute accuracy, while DP-Beam adds roughly 5%.Source: §5 · p. 6

Generalization Results

  • 92% accuracy is achieved by Attention-C-DP with Beam=1000 on the synthesis task.Attention-C-DP with Beam=100 reaches 89% accuracy at roughly 0.3 seconds per test instance.Source: §5 · p. 6

Comparison to Past Work

  • The stronger accuracy improvement over prior statistical synthesis is attributed to late pooling, attention mechanisms, and a more expressive DSL.GetSpan() was required for approximately 20% of test instances, while the expanded DSL increased the search space tenfold.Source: §5.1 · p. 6, §5.2 · p. 6

Consistency vs. Generalization

  • Generalization accuracy increases as the number of observed I/O examples increases.Figure 5 reports results across beam sizes and numbers of observed examples using Attention-C.Source: Figure 5 · p. 6
  • Beam=1 produces consistent output for roughly 50% of instances, indicating that learned latent function semantics remain imperfect.Consistency stays relatively constant as the number of observed examples increases.Source: §5.2 · p. 7

6. Program Induction Results

Program induction generates outputs directly rather than synthesizing an executable program, whereas synthesis generates a program and selects candidates using consistency. Under strict all-example accuracy, synthesis outperforms induction, while average-example accuracy favors induction relatively because outputs are decoded independently.

Model Differences

  • Induction generates each output string directly, while synthesis generates a program executed by the DSL to produce the output.Induction does not use the program P and instead predicts the output character-by-character.Source: §6 · p. 7, §6.1 · p. 7

Comparison of Induction and Synthesis Models

  • 53% induction accuracy compares with 81% for synthesis under strict all-example generalization accuracy.All six assessment examples must be exactly correct; synthesis uses Beam=100, while induction uses Beam=3.Source: §6.1 · p. 7

Decoding and Consistency

  • Induction cannot improve through larger search because decoded candidates cannot be evaluated for consistency.Synthesis evaluates k-best program candidates one-by-one and selects the first consistent program.Source: §6.1 · p. 7, §6 · p. 7

Average-Example Accuracy

  • Average-example accuracy credits the proportion of assessment examples that are exactly correct across test instances.Unlike all-example accuracy, this metric gives partial credit when, for example, five of six assessment examples are correct.Source: §6.2 · pp. 7–8
  • 33% of induction test instances are partially correct, compared with less than 10% for both synthesis conditions.Independent decoding gives induction a higher chance of getting some assessment examples correct, although synthesis still leads in absolute performance by 10%.Source: Figure 7 · p. 8

Metric Choice

  • The preferred metric depends on the downstream application: all-example accuracy suits complete spreadsheet columns, whereas average-example accuracy suits per-cell autocomplete.The paper states that neither metric should universally receive more credence.Source: §6.2 · p. 8

7. Handling Noisy I/O Examples

The study evaluates robustness to noisy I/O examples by injecting simulated typos into FlashFill inputs and comparing neural models with Excel FlashFill. Neural models degrade gradually, whereas the rule-based system fails under minimal noise.

  • Noise was synthetically injected into observed input or output strings using random character insertions, deletions, and substitutions.Assessment examples remained clean so evaluation stayed possible.Source: §7 · p. 8
  • Neural models degraded by approximately 2% absolute accuracy for each noise character introduced.Source: §7 · p. 8
  • 92% accuracy: Excel FlashFill matched the best reported result without noise.FlashFill’s implementation was evaluated using Microsoft Excel 2016.Source: §7 · p. 8
  • One or two noise characters effectively broke Excel FlashFill, whose algorithm relies critically on exact string matching.Source: §7 · p. 8

8. Conclusions

The paper concludes that its neural synthesis model performs strongly on a real-world Programming By Example task and remains robust to moderate I/O noise. Comparing synthesis and induction shows that their relative strengths depend on the evaluation condition.

  • 92% accuracy: the neural synthesis model matched the hand-engineered system on a real-world Programming By Example task.Source: §8 · p. 8
  • 58%: the neural synthesis model outperformed the previous-best neural synthesis model by this margin.Source: §8 · p. 8
  • Neural models remained robust to moderate I/O noise, while the hand-engineered system failed under even small amounts of noise.Source: §8 · p. 8
  • Synthesis performed better on this task, but induction had strength under evaluation conditions emphasizing the number of correct outputs.Synthesis had an advantage when all outputs needed to be correct.Source: §8 · p. 9

Supplementary Material

The supplementary material specifies the DSL’s string-transformation semantics and explains how programs are represented and executed. Its operators extract, transform, combine, and compose substrings from an input string.

B. Synthetic Evaluation Details

Synthetic experiments use programs sampled from the DSL, but the paper emphasizes real-world evaluation because synthetic difficulty depends on the generation procedure. Synthetic validation accuracy nevertheless tracks performance on the FlashFill dataset.

D. Induction Network Architecture

The program induction architecture modifies synthesis Attention-A with double attention and an additional LSTM for encoding input examples. Figures illustrate the architecture, sampled examples, test predictions, and incorrect outputs.

Architecture

  • The induction network uses double attention to jointly attend to Ix and Oj, plus an LSTM to encode Ix.This architecture is described as a modification of synthesis Attention-A.Source: D. Induction Network Architecture · p. 12
  • Figure 11 depicts the induction network architecture, where dotted connections indicate that one variable attends to another.The figure provides the complete architectural diagram.Source: Figure 11 · p. 13

Training examples

  • Figure 12 shows randomly sampled training programs with corresponding input-output examples, including multiline examples split at spaces.Source: Figure 12 · p. 14

Test examples

  • Figure 13 presents FlashFill test examples with input strings, output strings, and execution results from predicted programs.Long strings are visually broken or hyphenated for readability, without changing the examples.Source: Figure 13 · p. 15

Prediction errors

  • Figure 14 shows incorrect FlashFill predictions, including inconsistent programs and consistent programs that fail to generalize.Source: Figure 14 · p. 17

Related papers

Loading 1703.07469v1…