Gradient-Based Program Synthesis with Neurally Interpreted Languages
Matthew Macfarlane, Clément Bonnet, Herke van Hoof, Levi Lelis
Abstract
A central challenge in program induction has long been the trade-off between symbolic and neural approaches. Symbolic methods offer compositional generalisation and data efficiency, yet their scalability is constrained by formalisms such as domain-specific languages (DSLs), which are labour-intensive to create and may not transfer to new domains. In contrast, neural networks flexibly learn from data but tend to generalise poorly in compositional and out-of-distribution settings. We bridge this divide with an instance of a Latent Adaptation Network architecture named Neural Language Interpreter (NLI), which learns its own discrete, symbolic-like programming language end-to-end. NLI autonomously discovers a vocabulary of primitive operations and uses a novel differentiable neural executor to interpret variable-length sequences of these primitives. This allows NLI to represent programs that are not bound to a constant number of computation steps, enabling it to solve more complex problems than those seen during training. To make these discrete, compositional program structures amenable to gradient-based optimisation, we employ the Gumbel-Softmax relaxation, enabling the entire model to be trained end-to-end. Crucially, this same differentiability enables powerful test-time adaptation. At inference, NLI's program inductor provides an initial program guess. This guess is then refined via gradient descent through the neural executor, enabling efficient search for the neural program that best explains the given data. We demonstrate that NLI outperforms in-context learning, test-time training, and continuous latent program networks on tasks that require combinatorial generalisation and rapid adaptation to unseen tasks. Our results establish a new path toward models that combine the compositionality of discrete languages with the gradient-based search and end-to-end learning of neural networks. * Work completed while a visiting student at the University of Alberta.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ef61b79e-6d0b-4b80-bcb5-099ee3dadfdeBuilds on6
- Straightening Out the Straight-Through Estimator: Overcoming Optimization Challenges in Vector Quantized NetworksMinyoung Huh, Brian Cheung, Pulkit Agrawal, Phillip IsolaICML 2023 · 104 citations
- BUSTLE: Bottom-Up Program Synthesis Through Learning-Guided ExplorationAugustus Odena, Kensen Shi, David Bieber, Rishabh Singh et al.ICLR 2021 · 60 citations
- Just-in-time learning for bottom-up enumerative synthesisShraddha Barke, Hila Peleg, Nadia PolikarpovaOOPSLA 2020 · 33 citations
- Latent Programmer: Discrete Latent Codes for Program SynthesisJoey Hong, David Dohan, Rishabh Singh, Charles Sutton et al.ICML 2021 · 25 citations
- Searching Latent Program SpacesMatthew Macfarlane, Clément BonnetNeurIPS 2025 · 23 citations
Related papers
- Data-Efficient Learning with Neural ProgramsAlaia Solko-Breslin, Seewon Choi, Ziyang Li, Neelay Velingker et al.NeurIPS 2024 · 10 citations
- Differentiable Synthesis of Program ArchitecturesGuofeng Cui, He ZhuNeurIPS 2021 · 20 citations
- Differentiable Tree Operations Promote Compositional GeneralizationPaul Soulos, Edward J. Hu, Kate McCurdy, Yunmo Chen et al.ICML 2023 · 7 citations
- Learning Differentiable Programs with Admissible Neural HeuristicsAmeesh Shah, Eric Zhan, Jennifer J. Sun, Abhinav Verma et al.NeurIPS 2020 · 56 citations
- Representing Partial Programs with Blended Abstract SemanticsMaxwell I. Nye, Yewen Pu, Matthew Bowers, Jacob Andreas et al.ICLR 2021 · 23 citations
