L EVERAGING G RAMMAR
FOR
N EURAL P ROGRAM S YNTHESIS THROUGH R EINFORCEMENT L EARNING
Anonymous authors
Paper under double-blind review
A BSTRACT
Program synthesis is the task of automatically generating a program consistent with a speciﬁcation.
Recent years have seen proposal of a number of neural approaches for program synthesis, many of which adopt a sequence generation paradigm similar to neural machine translation, in which sequence-to-sequence models are trained to maximize the likelihood of known reference programs.
While achieving impressive results, this strategy has two key limitations.
First, it ignores Program Aliasing : the fact that many different programs may satisfy a given speciﬁcation (especially with incomplete speciﬁcations such as a few input-output examples).
By maximizing the likelihood of only a single reference program, it penalizes many semantically correct programs, which can adversely affect the synthesizer performance.
Second, this strategy overlooks the fact that programs have a strict syntax that can be efﬁciently checked.
To address the ﬁrst limitation, we perform reinforcement learning on top of a supervised model with an objective that explicitly maximizes the likelihood of generating semantically correct programs.
For addressing the second limitation, we introduce a training procedure that directly maximizes the probability of generating syntactically correct programs that fulﬁll the speciﬁcation.
We show that our contributions lead to improved accuracy of the models, especially in cases where the training data is limited.
I NTRODUCTION
The task of program synthesis is to automatically generate a program that is consistent with a speciﬁcation such as a set of input-output examples, and has been studied since the early days of
Artiﬁcial Intelligence (Waldinger and Lee, 1969).
There has been a lot of recent progress made on neural program induction , where novel neural architectures inspired from computation modules such as RAM, stack, CPU, turing machines, and GPU (Graves et al., 2014; Joulin and Mikolov, 2015;
Kurach et al., 2016; Graves et al., 2016;
Reed and de Freitas, 2016; Kaiser and Sutskever, 2016) have been proposed to train these architectures in an end-to-end fashion to mimic the behavior of the desired program.
While these approaches have achieved impressive results, they do not return explicit interpretable programs, tend not to generalize well on inputs of arbitrary length, and require a lot of examples and computation for learning each program.
To mitigate some of these limitations, neural program synthesis approaches (Johnson et al., 2017; Parisotto et al., 2017; Devlin et al., 2017) have been recently proposed that learn explicit programs in a Domain-speciﬁc language (DSL) from as few as ﬁve input-output examples.
These approaches, instead of using a large number of input-output examples to learn a single program, learn a large number of different programs, each from just a few input-output examples.
During training, the correct program is provided as reference, but at test time, the learnt model generates the program from only the input-output examples.
While neural program synthesis techniques improve over program induction techniques in certain domains, they suffer from two key limitations.
First, these approaches use supervised learning with reference programs and suffer from the problem of Program Aliasing :
For a small number of input-output examples, there can be many programs that correctly transform inputs to outputs.
The problem is the discrepancy between the single supervised reference program and the multitude of correct programs.
Figure 1 shows an example of this: if maximizing the probability of ground truth program, predicting Program B would be assigned a high loss even though the two programs are semantically equivalent for the input-output example.
Maximum likelihood training forces the model to learn to predict ground truth programs, which is different from the true objective of program synthesis: predicting any consistent program.
To address this problem, we alter the optimization
[Figure]
objective: instead of maximum likelihood, we use policy gradient reinforcement learning to directly encourage generation of any program that is consistent with the given examples.
The second limitation of neural program synthesis techniques based on sequence generation paradigm (Devlin et al., 2017) is that they often overlook the fact that programs have a strict syntax, which can be checked efﬁciently.
We explore a method for leveraging the syntax of the programming language in order to aggressively prune the exponentially large search space of possible programs.
In particular, not all sequences of tokens are valid programs and syntactically incorrect programs can be efﬁciently ignored both during training and at test time.
However, a syntax checker is an additional form of supervision that may not always be present.
To address this limitation, we introduce a neural architecture that retains the beneﬁts of aggressive syntax pruning without needing an actual syntax checker.
This model is jointly conditioned on syntactic and program correctness, and implicitly learns the syntax of the language while training.
We demonstrate the efﬁcacy of our approach by developing a neural program synthesis system for the Karel programming language (Pattis, 1981), an educational programming language, consiting of control ﬂow constructs such as loops and conditionals, making it more complex than the domains tackled by previous neural program synthesis works.
This paper makes the following key contributions:
• We show that Reinforcement Learning can directly optimize for generating any consistent program and improves performance compared to pure supervised learning.
• We introduce a method for pruning the space of possible programs using a syntax checker and show that explicit syntax checking helps generate better programs.
• In the absence of a syntax checker, we introduce a model that jointly learns syntax and the production of correct programs.
We demonstrate this model improves performance in instances with limited training data.
R ELATED WORK
Program synthesis is one of the fundamental problems in Artiﬁcial Intelligence.
To the best of our knowledge, it can be traced back to the work of Waldinger and Lee (1969) where a theorem prover was used to construct LISP programs based on a formal speciﬁcation of the input-output relation.
As formal speciﬁcation is often as complex as writing the original program, many techniques were developed to achieve the same goal with simpler partial speciﬁcations in the form of input-output (IO) examples (Amarel, 1970; Summers, 1977).
Rule-based synthesis approaches have recently been successful in delivering on the promise of Programming By Example (Lieberman, 2001), the most widely known example being the FlashFill system (Gulwani et al., 2012) in Excel.
However, such systems are extremely complicated to extend and need signiﬁcant development time from domain experts to provide the pruning rules for efﬁcient search.
As a result, the use of Machine Learning methods have been proposed, based on Bayesian probabilistic models (Liang et al., 2010) or Inductive Logic programming (Muggleton, 1991; Muggleton et al., 2014) to automatically generate programs based on examples.
Recently, inspired by the success of Neural Networks in other applications such as vision (Krizhevsky et al., 2012) or speech recognition (Graves et al., 2013) differentiable controllers were made to learn the behaviour of programs by using gradient descent over differentiable version of traditional programming concepts such as memory addressing (Graves et al., 2014), manipulating stacks (Joulin and Mikolov, 2015;
Grefenstette et al., 2015), register machines (Kurach et al., 2016), and data manipulation (Neelakantan et al., 2016).
These approaches to program induction however tend to struggle with generalization, especially when presented with inputs of a different dimension than the one they were trained with and require a very large amount of training data.
Some exceptions to this include Neural Programmer
Interpreters (Reed and de Freitas, 2016) and its extensions (Li et al., 2017; Cai et al., 2017) that learn from program traces rather than only examples.
However, they still learn a different model for each program and are computationally expensive, unlike our system that uses a single model for learning a large number of programs.
A series of recent works aim to infer explicit program source code with the assumption that code structure provides an inductive bias for better generalization.
In particular, explicitly modeling control ﬂow statements such as conditionals and loops can often lead to programs capable of generalizing, regardless of input size (Gaunt et al., 2016;
Bunel et al., 2016;
Riedel et al., 2017).
One remaining drawback of these approaches is the need to restart learning from scratch for each new program.
Thus they are largely unsuited for the situation of synthesizing a new program on-the-ﬂy from very few examples.
The latest developments use large datasets of artiﬁcially generated programs and learn to map embeddings of IO examples to information about the programs to generate.
Balog et al.
(2017) produce scores over attributes, to be used as heuristics to speed up search-based techniques.
Parisotto et al.
(2017) use their dataset to learn probability over the expansion rules of a predeﬁned grammar, while (Devlin et al., 2017) directly predict the source code of the programs.
These last two methods use supervised training to maximize the likelihood of a single reference program, while we directly optimize for the generation of any consistent program.
Our approach to optimize program correctness is similar in spirit to advances in Neural Machine
Translation (Wu et al., 2016; Ranzato et al., 2016) that leverage reinforcement learning to optimize directly for evaluation metrics.
Taking advantage of the fact that programs can be syntactically checked and unit tested against the speciﬁcation examples, we show how to improve on those
REINFORCE (Williams, 1992) based methods.
Recently, Guu et al.
(2017) proposed a method similar to ours based on Maximum Marginal Likelihood to generate programs based on a description in natural language.
From an application point of view, our target domain is more complex as our
DSL includes control ﬂow operations such as conditionals and loops.
Moreover, natural language utterances fully describe the steps that the program needs to take, while learning from IO examples requires planning over potentially long executions.
Their approach is more akin to inferring a formal speciﬁcation based on a natural language description, as opposed to our generation of imperative programs.
Incorporating knowledge of the grammar of the target domain to enforce syntactical correctness has already proven useful to model arithmetic expressions, molecules (Kusner et al., 2017), and string manipulation programs (Parisotto et al., 2017).
These approaches deﬁne the model over the production rules of the grammar; we instead operate directly over the terminals of the grammar.
This allows us to learn the grammar jointly with the model in the case where no formal grammar speciﬁcation is available.
Our approach is extremely general and can be applied to the very recently proposed methods for inferring and executing programs for visual reasoning (Johnson et al., 2017) that to the best of our knowledge does not directly explictly encourage grammar consistency of the resulting program.
P ROBLEM OVERVIEW
Before describing our proposed methods, we establish the necessary notation, present the problem setting and describe the general paradigm of our approach.
3. P ROGRAM S YNTHESIS FORMULATION
To avoid confusion with probabilities, we will use the letter λ to denote programs.
I and O will be used to denote respectively input states and output states and we will use the shortcut IO to denote a pair of corresponding input/output examples.
A state constitutes what the programs are going to be operating on, depending on the application domain.
In FlashFill-type applications (Parisotto et al., 2017; Devlin et al., 2017), Input and Output states would be strings of characters, while in our Karel environment, states are grids describing the presence of objects.
If we were to apply our method to actual programming languages, states would represent the content of the machine’s registers and the memory.
[Figure]
Fullyconnected
LSTM
LSTM < start >
Maxpool < start >
Syntax
SoftMax
LSTM
LSTM < def >
Maxpool < def >
Syntax
At training time, we assume to have access to N training samples, each training sample consisting of a set of K Input/Output states and a program implementing the mapping correctly:
[Equation] [Equation]
N such that:
[Equation]
where λ i ( I ki ) denotes the resulting state of applying the program
λ i to the input state I ki .
Our goal is to learn a synthesizer σ that, given a set of input/output examples produces a program:
[Equation]
We evaluate the programs on a set of test cases for which we have both speciﬁcation examples and held-out examples:
[Equation]
At test time, we evaluate the performance of our learned synthesizer by generating, for each sample in the test set, a program ˆ λ j .
The metric we care about is Generalization : (cid:110)
j ∈ { 1 ..N test } such that ˆ λ j
( I kj ) =
= O kj ∀ k ∈ (cid:8) 1 ..K (cid:48) (cid:9) (cid:111) where ˆ
λ j = σ (cid:18)(cid:110) IO k spec j (cid:111) k spec =1 ..K (cid:19) .
N EURAL P ROGRAM S YNTHESIS A RCHITECTURE
Similar to Devlin et al.
we use a sequential LSTM-based (Hochreiter and Schmidhuber, 1997) language model, conditioned on an embedding of the input-output pairs.
Each pair is encoded independently by a convolutional neural network (CNN) to generate a joint embedding.
A succinct description of the architecture can be found in section 6.1 and the exact dimensions are available in the supplementary materials.
Each program is represented by a sequence of tokens λ
= [ s 1 , s 2 , ..., s L ] where each token comes from an alphabet Σ .
We model the program one token at a time using an LSTM.
At each timestep, the input consists of the concatenation of the embedding of the IO pair and of the last predicted token.
One such decoder LSTM is run for each of the IO pairs, all using the same weights.
The probability of the next token is deﬁned as the Softmax of a linear layer over the max-pooled hidden state of all the decoder LSTMs.
A schema representing this architecture can be seen in Figure 2.
The form of the model that we are learning is:
[Equation]
At test time, the most likely programs are obtained by running a beam search.
One of the advantages of program synthesis is the ability to execute hypothesized programs.
Through execution, we remove syntactically incorrect programs and programs that are not consistent with the observed examples.
Among the remaining programs, we return the most likely according to the model.
O BJECTIVE F UNCTIONS 4. M AXIMUM L IKELIHOOD OPTIMIZATION
To estimate the parameters θ of our model, the default solution is to perform supervised training, framing the problem as Maximum Likelihood estimation.
Devlin et al.
(2017) follow this approach and use stochastic gradient descent to solve:
[Equation]
However, this training objective exhibits several drawbacks.
First, at training time, the model is only exposed to the training data distribution, while at test time, it is fed back the token from its own previous predictions.
This discrepancy in distribution of the inputs is well known in Natural
Language Processing under the name of exposure bias (Ranzato et al., 2016).
Moreover, this loss does not represent the true objective of program synthesis.
In practice, any equivalent program should be as valid a prediction as the reference one.
This property, that we call program aliasing , is not taken into account by the MLE training.
Ideally, we would like the model to learn to reason about the necessary steps needed to map the input to the output.
As a result, the loss shouldn’t penalize correct programs, even if they do not correspond to the ground truth.
4. O PTIMIZING E XPECTED C ORRECTNESS
The ﬁrst modiﬁcation that we propose is to change the target objective to bring it more in line with the goal of program synthesis.
We replace the optimization problem of (6) by
[Equation]
where R i ( λ ) is a reward function designed to encode the quality of the sampled programs.
Note that this formulation is extremely generic and would allow to represent a wide range of different objective functions.
If we assume that we have access to a simulator to run our programs, we can design R i so as to optimize for generalization on held-out examples, preventing the model to overﬁt on its inputs.
Additional property such as program conciseness, or runtime efﬁciency could also be encoded into the reward.
However, this expressiveness comes at a cost: the inner sum in (7) is over all possible programs and therefore is not tractable to compute.
The standard method consists of approximating the objective by sampling S samples from the model and deriving gradients using the REINFORCE trick (Williams, 1992).
[Equation]
where
[Equation]
However, given that we sample from a unique model, there is a high chance that we will sample the same programs repeatedly.
This is especially true when the model has been pre-trained in a supervised manner.
A different approach is to approximate the distribution by its S most likely samples, as obtained for example by a Beam Search.
While this approach introduces a bias in the expectation that we compute, it also has the advantage of aligning the training procedure more closely with the testing procedure where only likely samples are going to be decoded.
The objective function that we are optimizing becomes:
[Equation]
where
[Equation]
Based on this more tractable distribution, we can deﬁne more complex objective functions.
In program synthesis, we have the possibility to prune out several predictions by using the speciﬁcation.
Therefore, we can go beyond optimizing the expected reward when sampling a single program and optimize the expected reward when sampling a bag of C programs and keeping the best one.
This results in a new objective function:
[Equation]
where q θ is deﬁned as previously.
We argue that by optimizing this objective function, the model gets the capability of “hedging its bets” and assigning probability mass to several candidates programs, resulting in a higher diversity of outputs.
In the special case where the reward function only takes values in { 0 , 1 } , as it is when we are using correctness as a reward, this can be more easily computed as:
[Equation]
The derivation leading to this formulation as well as a description on how to efﬁciently compute the more general loss(10) can be found in appendix A. Note that although this formulation brings the training objective function closer to the testing procedure, it is still not ideal.
It indeed makes the assumption that if we have a correct program in our bag of samples, we can identify it, ignoring the fact that it is possible to have some incorrect program consistent with the IO pairs partial speciﬁcation (and therefore not prunable).
M ODEL 5. C ONDITIONING ON THE SYNTAX
One aspect of the program synthesis task is that syntactically incorrect programs can be trivially identiﬁed and pruned before making a prediction.
As a result, if we use stx to denote the event that the sampled program is syntactically correct, what we care about modeling correctly is p ( λ | (cid:8) IO ki (cid:9) k
=1 ..K , stx ) .
Using Bayes rule, we can rewrite this:
[Equation]
We drop the conditional dependency on the IO pairs in the second line of (12) as the syntactical correctness of the program is independent from the speciﬁcation when conditioned on the program.
We can do the same operation at the token level, denoting by stx 1 ...
t the event that the sequence of the ﬁrst t tokens s 1 · · · s t doesn’t contain any syntax error and may therefore be a preﬁx to a valid program.
[Equation]
Given a grammar, it is possible to construct a checker to determine valid preﬁxes of programs.
Example applications include compilers to signal syntax errors to the user and autocomplete features of Integrated Development Environments (IDEs) to restrict the list of suggested completions.
The quantity p ( stx 1 ...t | s 1 · · · s t ) is therefore not a probability but can be implemented as a deterministic process for a given target programming language.
In practice, this is implemented by getting at each timestep a mask M = {− inf , 0 } | Σ | where M j = − inf if the j -th token in the alphabet is not a valid token in the current context, and 0 otherwise.
This mask is added to the output of the network, just before the Softmax operation that normalizes the output to a probability over the tokens.
Conditioning on the syntactical correctness of the programs provides several advantages: First, sampled programs become syntactically correct by construction.
At test time, it allows the beam search to only explore useful candidates.
It also ensures that when we are optimizing for correctness, the samples used to approximate the distribution are all going to be valid candidates.
Restricting the dimension of the space on which our model is deﬁned also makes the problem simpler to learn.
5. J OINTLY LEARNED SYNTAX
It may not always be feasible to assume access to a syntax checker.
In general, we wish to retain the syntax checker’s ability to aggressively prune the search in program space without requiring access to the syntax itself.
To this end, we propose to represent the syntax checker as a neural network module and learn it jointly.
Similar to the base model, we implement learned syntax checking using an LSTM g φ .
Comparing to the decoder LSTM, there are two major differences:
• The syntaxLSTM is conditioned only on the program tokens, not on the IO pairs.
This ensures that the learned checker models only the syntax of the language.
• The output of the syntaxLSTM is passed through an elementwise x (cid:55)→ − exp( x ) activation function and added to the decoder LSTM’s output.
Similar to the mask in Section 5.1, the exponential activation function allows the syntaxLSTM to output high penalties to any tokens deemed syntactically incorrect.
In the supervised setting, we add an additional term to the loss (6) to prevent the model from masking valid programs:
[Equation]
This loss penalizes the syntaxLSTM for giving negative scores to each token belonging to a known valid program.
In supervised learning, known valid programs are the reference programs.
E XPERIMENTS 6. T HE DOMAIN : K AREL
The Karel programming language is an educational programming language (Pattis, 1981), used for example in Stanford CS introductory classes (cs1) or in the Hour of Code initiative (hoc).
It features an agent inside a gridworld (See Figure 1), capable of moving ( move , turn{Left,Right} ), modifying world state ( {pick,put}Marker ), and querying the state of the nearby environment for its own markers ( markerPresent , noMarkerPresent ) or for natural obstacles ( frontIsClear , leftIsClear , rightIsClear ).
Our goal is to learn to generate a program in the Karel DSL given a small set of input and output grids.
The language supports for loops, while loops, and conditionals, but no variable assignment.
The speciﬁcation for the DSL can be found in appendix B.
To evaluate our method, we follow the standard practice (Devlin et al., 2017; Parisotto et al., 2017;
Neelakantan et al., 2016;
Balog et al., 2017) and generate a synthetic dataset by randomly sampling programs from the DSL.
We perform a few simple heuristic checks to ensure generated programs have observable effect on the world and prune out programs performing spurious actions (e.g. executing a turnLeft just after a turnRight for example).
For each program, we generate a set of IO pairs by sampling random input grids and executing the program on them to obtain the corresponding output grids.
We sample a large number of them and keep 6 for each program, ensuring that all conditionals in a program are hit by at least one of the examples.
The ﬁrst 5 samples serve as the speciﬁcation, and the sixth one is kept as held-out test pair.
We reserve 5000 programs that we split out between a validation set and a test set.
We represent the input and output elements as grids where each cell in the grid is a vector withchannels, indicating the presence of elements ( AgentFacingNorth , AgentFacingSouth , · · · ,
Obstacle , OneMarkerPresent , TwoMarkersPresent , · · · ).
The input and output grids are initially passed through independent convolution layers, before being concatenated and passed through two convolutional residual blocks and a fully connected layer, mapping them to a ﬁnal 512-dimensional representation.
We run one decoder per IO pair and perform a maxpooling operation over the output of all the decoders, out of which we perform the prediction of the next token.
Our models are implemented using the Pytorch framework (pyt).
Code and data will be made available.
6. R ESULTS
We trained a variety of models on the full Karel dataset containing 1-million examples as well as a reduced dataset containing only 10 , 000 examples.
In general, the small dataset serves to help understand the data efﬁciency of the program synthesis methods and is motivated by the expected difﬁculty of obtaining many labeled examples in real-world program synthesis domains.
Models are grouped according to training objectives.
As a baseline, we use MLE , which corresponds to the maximum likelihood objective (Eq.6), similar to the method proposed by Devlin et al.
Unless otherwise speciﬁed, the reward considered for our other methods is generalization: +1 if the program matches all samples, including the held out one and 0 otherwise.
RL uses the expected reward objective (Eq.7), using REINFORCE to obtain a gradient estimate (Equation (8)).
RL_beam attempts to solve the proxy problem described by Equation (9) and RL_beam_div the richer loss function of Equation (11).
RL_beam_div_opt also optimizes the loss of equation (10) but the reward additionally includes a term inversly proportional to the number of timesteps it takes for the program to ﬁnish executing.
All RL models are initialized from pretrained supervised models.
[Table] [Table]
as k increases than RL.
Methods employing beam search and diversity objectives reduce this accuracy gap by encouraging diversity in the beam of partial programs.
[Table]
Optimizing for correctness (RL): Results in Table 1 show that optimizing for the expected program correctness consistently provides improvements in top-1 generalization accuracy.
Top-1 Generalization Accuracy (Eq. 4) denotes the accuracy of the most likely program synthesized by beam search decoding having the correct behaviour across all input-output examples.
The improved performance of RL methods conﬁrms our hypothesis RL can effectively combat the program aliasing problem.
On the full dataset, when optimizing for correctness, Exact Match Accuracy decreases, indicating that the RL models no longer prioritize generating programs that exactly match the references.
On the small dataset, RL_beam methods improves both exact match accuracy and generalization.
Comparing RL_beam to standard RL, we note improvements across all levels of generalization.
By better aligning the RL objective with the sampling that happens during beam search decoding, consistent improvements can be made in accuracy.
Further improvements are made by encouraging diversity in the beam of solutions (RL_beam_div) and penalizing long running programs (RL_beam_div_opt).
In the settings where little training data is available, RL methods show more dramatic improvements over MLE, indicating that data efﬁciency of program synthesis methods can be greatly improved by using a small number of samples ﬁrst for supervised training and again for Reinforcement Learning.
As a side note, we were unable to achieve high performance when training the RL methods from scratch.
The necessity of extensive supervised pretraining to get beneﬁts from Reinforcement
Learning ﬁne-tuning is well-known in the Neural Machine Translation literature (Ranzato et al., 2016;
Wu et al., 2016; Wiseman and Rush, 2016; Bahdanau et al., 2017).
Table 2 examines the top-1, top-5, and top-50 generalization accuracy of supervised and RL models.
RL_beam methods performs best for top-1 but their advantage drops for higher-rank accuracy.
Inspection of generated programs shows that the top predictions all become diverse variations of the same program, up to addition/removal of no-operations ( turnLeft followed by turnRight , full circle obtained by a series of four turnLeft ).
The RL_beam_div objective helps alleviate this effect as does RL_beam_div_opt, which penalizes redundant programs.
This is important as in the task of Program Synthesis, we may not necessarily need to return the most likely output if it can be pruned by our speciﬁcation.
Impact of syntax: We also compare models according to the use of syntax: MLE_handwritten denotes the use of a handwritten syntax checker (Sec 5.1), MLE_learned denotes a learned syntax (Sec 5.2), while no sufﬁx denotes no syntax usage.
Table 3 compares syntax models.
On the full dataset, leveraging the handwritten syntax leads to marginally better accuracies than learning the syntax or using no syntax.
Given access to enough data, the network seems to be capable of learning to model the syntax using the sheer volume of training examples.
On the other hand, when the amount of training data is limited, learning the syntax produces signiﬁcantly better performance.
By incorporating syntactic structure in the model architecture and objective, more leverage is gained from small training data.
Interestingly, the learned syntax model even outperforms the handwritten syntax model.
We posit the syntaxLSTM is free to learn a richer syntax.
For example, the syntaxLSTM could learn to model the distribution of programs and discourage the prediction of not only syntactically incorrect programs, but also the unlikely ones.
To control for the extra parameters introduced by the syntaxLSTM, we compare against MLE_large, which uses no syntax but features a larger decoder LSTM, resulting in the same number of parameters as MLE_learned.
Results show that the larger number of parameters is not enough to explain the difference in performance, which again indicates the utility of jointly learning syntax.
Analysis of learned syntax: Section 5.2 claimed that by decomposing our models into two separate decoders, we could decompose the learning so that one decoder would specialize in picking the likely tokens given the IO pairs, while the other would enforce the grammar of the language.
We now provide experimental evidence that this decomposition happens in practice.
[Figure] [Figure]
Table 4 shows the percentage of syntactically correct programs among the most likely predictions of the MLE + learned model trained on the full dataset.
Both columns correspond to the same set of parameters but the second column doesn’t apply the syntaxLSTM’s mask to constrain the decoding process.
The precipitous drop in syntax accuracy indicates the extent to which the program decoder has learned to rely on the syntaxLSTM to produce syntactically correct programs.
Figure 3 compares the syntax masks generated by the learned and handwritten syntax models while decoding
Program A in Figure 1. (3a) shows output of the handwritten syntax checker; (3b) shows syntaxLSTM output.
White cells indicates tokens that are labeled syntactically correct at each decoding step.
Figure 3c analyzes the difference between the handwritten and learned syntax masks.
White indicates similar output, which occupies the majority of the visualization.
Blue cells correspond to instances where the syntaxLSTM labeled a token correct when it actually was syntactically incorrect.
This type of error can be recovered if the program decoder predicts those tokens as unlikely.
On the other hand, red cells indicate the syntaxLSTM predicted a valid token is syntactically incorrect.
This type of error is more dangerous because the program decoder cannot recover the valid token once it is declared incorrect.
The majority of red errors correspond to tokens which are rarely observed in the training dataset, indicating that the syntaxLSTM learns to model more than just syntax - it also captures the distribution over programs.
Given a large enough dataset of real programs, the syntaxLSTM learns to consider non-sensical and unlikely programs as syntactically incorrect, ensuring that generated programs are both syntactically correct and likely.
C ONCLUSION
We presented two novel contributions to improve state-of-the-art neural program synthesis techniques.
Our ﬁrst contribution uses Reinforcement Learning to optimize for generating any consistent program, which we show helps in improving generalization accuracy of the learned programs for large training datasets.
Our second contribution incorporates syntax checking as an additional conditioning mechanism for pruning the space of programs during decoding.
We show that incorporating syntax leads to signiﬁcant improvements with limited training datasets.
A C OMPUTING THE RICHER LOSS FUNCTION
In this section, we describe how the objective function of Equation (10) can be computed.
We have a distribution q θ over S programs, as obtained by performing a beam search over p θ and renormalizing.
We are going to get C independent samples from this distribution and obtain a reward corresponding to the best performing of all of them.
In the case where the reward function R i ( λ r ) is built on a boolean property, such as for example “correctness of the generated program”, Equation (10) can be simpliﬁed.
As R i ( λ r ) can only take the values 0 or 1, the term max j ∈ 1 ..
C R i ( λ j ) is going to be equal to 0 only if all of the C sampled programs give a reward of zero.
For each sample, there is a probability of q
[Equation]
= (cid:80)
[Equation]
..K ) of sampling a program with rewards zero.
The probability of not sampling a single correct program out of the C samples is q C incorrect .
From this, we can derive the form of Equation (11).
Note that this can be computed without any additional sampling steps as we have a close form solution for this expectation.
In the general case, a similar derivation can be obtained.
Assume that the programs outputted by the beam search have associated rewards R 0 , R 1 , ..., R S and assume without loss of generality that
R 0 < R 1 < .. < R S .
The probability of sampling a program with a reward smaller than R i is q ≤ R i
=
(cid:80) λ r ∈ BS
( p θ ,S )
[ R i ( λ r ) ≤ R i ] q θ ( λ r | (cid:8) IO ki (cid:9) k
=1 ..K )
so the probability of obtaining a ﬁnal reward of less than R i when sampling C samples is q C ≤ R i .
As a result, the probability of obtaining a reward of exactly R i is (cid:16) q C ≤ R
i − q C ≤ R i − 1 (cid:17) .
Based on this, it is easy to evaluate the loss function described by Equation (10).
B K AREL L ANGAGE SPECIFICATION
Prog p :=
def run () : s
Stmt s := while ( b ) : s | repeat ( r ) : s | s 1 ; s 2 | a | if ( b ) : s | ifelse ( b ) : s 1 else : s
Cond b := frontIsClear () | leftIsClear () | rightIsClear () | markersPresent () | noMarkersPresent () | not b
Action a :=
move () | turnRight () | turnLeft () | pickMarker () | putMarker ()
Cste r :=
| 1 | · · · |
C E XPERIMENTS HYPERPARAMETERS
The state of the grid word are represented as a 16 × 18 × 18 tensor.
For each cell of the grid, the 16-dimensional vector corresponds to the feature indicated in Table
The decoders are two-layer LSTM with a hidden size of 256.
Tokens of the DSL are embedded to a 256 dimensional vector.
The input of the LSTM is therefore of dimension 768 (256 dimensional of the token + 512 dimensional of the IO pair embedding).
The LSTM used to model the syntax is similarly sized but doesn’t take the embedding of the IO pairs as input so its input size is only 256.
One decoder LSTM is run on the embedding of each IO pair.
The topmost activation are passed through a MaxPooling operation to obtain a 256 dimensional vector representing all pairs.
This is passed through a linear layer to obtain a score for each of the 52 possible tokens.
We add the output of the model and of the eventual syntax model, whether learned or handwritten and pass it through a
SoftMax layer to obtain a probability distribution over the next token.
All training is performed using the Adam optimizer, with a learning rate of 10 − 4 .
[Table] [Table]
Conv2D, kernel size = 3, padding = 1, 16 →
Conv2D, kernel size = 3, padding = 1, 16 ->
ReLU
[Table]
Conv2D, kernel size = 3, padding 1, 64 →
ReLU
Conv2D, kernel size = 3, padding 1, 64 →
ReLU
Conv2D, kernel size = 3, padding 1, 64 →
ReLU
[Table]
Conv2D, kernel size = 3, padding 1, 64 →
ReLU
Conv2D, kernel size = 3, padding 1, 64 →
ReLU
Conv2D, kernel size = 3, padding 1, 64 →
[Table]
Fully Connected
[Table]