Latent Programmer: Discrete Latent Codes for Program Synthesis
Joey Hong, David Dohan, Rishabh Singh, Charles Sutton and, Manzil Zaheer

TL;DR
This paper introduces the Latent Programmer, a novel approach using discrete latent codes learned via self-supervised autoencoding to improve the efficiency and accuracy of program synthesis from examples and natural language descriptions.
Contribution
It proposes a new discrete latent representation for sequence outputs, enabling more effective search and synthesis in program generation tasks.
Findings
Discrete latent codes improve synthesis accuracy
The method enhances search efficiency in program synthesis
Effective in string transformation and natural language program generation
Abstract
In many sequence learning tasks, such as program synthesis and document summarization, a key problem is searching over a large space of possible output sequences. We propose to learn representations of the outputs that are specifically meant for search: rich enough to specify the desired output but compact enough to make search more efficient. Discrete latent codes are appealing for this purpose, as they naturally allow sophisticated combinatorial search strategies. The latent codes are learned using a self-supervised learning principle, in which first a discrete autoencoder is trained on the output sequences, and then the resulting latent codes are used as intermediate targets for the end-to-end sequence prediction task. Based on these insights, we introduce the \emph{Latent Programmer}, a program synthesis method that first predicts a discrete latent code from input/output examples,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsSoftware Engineering Research · Parallel Computing and Optimization Techniques · Topic Modeling
MethodsSolana Customer Service Number +1-833-534-1729
