Neural Program Synthesis with Query
Not on the map. Why?
Abstract (arXiv)
Aiming to find a program satisfying the user intent given input-output examples, program synthesis has attracted increasing interest in the area of machine learning. Despite the promising performance of existing methods, most of their success comes from the privileged information of well-designed input-output examples. However, providing such input-output examples is unrealistic because it requires the users to have the ability to describe the underlying program with a few input-output examples under the training distribution. In this work, we propose a query-based framework that trains a query neural network to generate informative input-output examples automatically and interactively from a large query space. The quality of the query depends on the amount of the mutual information between the query and the corresponding program, which can guide the optimization of the query framework. To estimate the mutual information more accurately, we introduce the functional space (F-space) which models the relevance between the input-output examples and the programs in a differentiable way. We evaluate the effectiveness and generalization of the proposed query-based framework on the Karel task and the list processing task. Experimental results show that the query-based framework can generate informative input-output examples which achieve and even outperform well-designed input-output examples.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 24 of its 49 references that are in the map. First posted on arXiv 8 May 2022.
Builds on
24 of 49 references.
References · 24
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 860
- 2018Programmatically Interpretable Reinforcement Learningcited by 193
- 2016DeepCoder: Learning to Write Programscited by 149
- 2020Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphscited by 129
- 2017RobustFill: Neural Program Learning under Noisy I/Ocited by 126
- 2019Write, Execute, Assess: Program Synthesis with a REPLcited by 93
- 2019Deep Active Learning: Unified and Principled Method for Query and Trainingcited by 93
- 2018Leveraging Grammar and Reinforcement Learning for Neural Program Synthesiscited by 84
12 more
- 2017Learning to Infer Graphics Programs from Hand-Drawn Imagescited by 74
- 2019Learning to Infer and Execute 3D Shape Programscited by 68
- 2020Synthesize, Execute and Debug: Learning to Repair for Neural Program Synthesiscited by 39
- 2020BUSTLE: Bottom-Up Program Synthesis Through Learning-Guided Explorationcited by 30
- 2018Automatic Program Synthesis of Long Programs with a Learned Garbage Collectorcited by 24
- 2020Learning to Represent Programs with Property Signaturescited by 16
- 2019Synthetic Datasets for Neural Program Synthesiscited by 15
- 2017Interactive Program Synthesiscited by 6
- 2020Neural Program Synthesis with a Differentiable Fixercited by 6
- 2017FlashProfile: A Framework for Synthesizing Data Profilescited by 5
- 2017Learning to Acquire Informationcited by 4
- 2019Information-Geometric Set Embeddings (IGSE): From Sets to Probability Distributionscited by 3
Built on by
Citing papers per year: 2022: 1; 2023: 1.
2 papers.
- 2023Online Symbolic Regression with Informative Querycited by 2
- 2022Deterministic Graph-Walking Program Miningcited by 0
- 2023Online Symbolic Regression with Informative Query21 Feb 2023
- 2022Deterministic Graph-Walking Program Mining22 Aug 2022