Name
Abstract | ||
|---|---|---|
We consider the task of program synthesis in the presence of a reward function over the output of programs, where the goal is to find programs with maximal rewards. We employ an iterative optimization scheme, where we train an RNN on a dataset of K best programs from a priority queue of the generated programs so far. Then, we synthesize new programs and add them to the priority queue by sampling from the RNN. We benchmark our algorithm, called priority queue training (or PQT), against genetic algorithm and reinforcement learning baselines on a simple but expressive Turing complete programming language called BF. Our experimental results show that our simple PQT algorithm significantly outperforms the baselines. By adding a program length penalty to the reward function, we are able to synthesize short, human readable programs. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Artificial Intelligence | Turing completeness,Program synthesis,Computer science,Priority queue,Sampling (statistics),Artificial intelligence,Genetic algorithm,Machine learning,Reinforcement learning |
DocType | Volume | Citations |
Journal | abs/1801.03526 | 7 |
PageRank | References | Authors |
0.43 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel A. Abolafia | 1 | 48 | 2.75 |
| Mohammad Norouzi | 2 | 1212 | 56.60 |
| Quoc V. Le | 3 | 8501 | 366.59 |