We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1801.03526")
get_code_for_paper("1801.03526")
have("1801.03526")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1801.03526.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1801.03526)
Connect an agent — have() is free.