pith. sign in

arxiv: 1612.01197 · v1 · pith:ZDZZ72SUnew · submitted 2016-12-04 · 💻 cs.CL · cs.AI· cs.LG

Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervision (Short Version)

classification 💻 cs.CL cs.AIcs.LG
keywords neuralmemorysemanticsupervisionsymbolicweakapproachescomputer
0
0 comments X
read the original abstract

Extending the success of deep neural networks to natural language understanding and symbolic reasoning requires complex operations and external memory. Recent neural program induction approaches have attempted to address this problem, but are typically limited to differentiable memory, and consequently cannot scale beyond small synthetic tasks. In this work, we propose the Manager-Programmer-Computer framework, which integrates neural networks with non-differentiable memory to support abstract, scalable and precise operations through a friendly neural computer interface. Specifically, we introduce a Neural Symbolic Machine, which contains a sequence-to-sequence neural "programmer", and a non-differentiable "computer" that is a Lisp interpreter with code assist. To successfully apply REINFORCE for training, we augment it with approximate gold programs found by an iterative maximum likelihood training process. NSM is able to learn a semantic parser from weak supervision over a large knowledge base. It achieves new state-of-the-art performance on WebQuestionsSP, a challenging semantic parsing dataset, with weak supervision. Compared to previous approaches, NSM is end-to-end, therefore does not rely on feature engineering or domain specific knowledge.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Learning to Place Objects with Programs and Iterative Self Training

    cs.GR 2025-03 unverdicted novelty 7.0

    A generative model writes programs in a relational constraint DSL and uses bootstrapping to learn object placement distributions that align more closely with human annotations than data-driven or LLM baselines.