Neural-Symbolic Recursive Machine for Systematic Generalization

• URL: http://arxiv.org/abs/2210.01603v2
• Date: Mon, 29 Apr 2024 08:32:37 GMT
• Title: Neural-Symbolic Recursive Machine for Systematic Generalization
• Abstract summary: We introduce the Neural-Symbolic Recursive Machine (NSR), whose core is a Grounded Symbol System (GSS) NSR integrates neural perception, syntactic parsing, and semantic reasoning. We evaluate NSR's efficacy across four challenging benchmarks designed to probe systematic generalization capabilities.
• Score: 113.22455566135757
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Current learning models often struggle with human-like systematic generalization, particularly in learning compositional rules from limited data and extrapolating them to novel combinations. We introduce the Neural-Symbolic Recursive Machine (NSR), whose core is a Grounded Symbol System (GSS), allowing for the emergence of combinatorial syntax and semantics directly from training data. The NSR employs a modular design that integrates neural perception, syntactic parsing, and semantic reasoning. These components are synergistically trained through a novel deduction-abduction algorithm. Our findings demonstrate that NSR's design, imbued with the inductive biases of equivariance and compositionality, grants it the expressiveness to adeptly handle diverse sequence-to-sequence tasks and achieve unparalleled systematic generalization. We evaluate NSR's efficacy across four challenging benchmarks designed to probe systematic generalization capabilities: SCAN for semantic parsing, PCFG for string manipulation, HINT for arithmetic reasoning, and a compositional machine translation task. The results affirm NSR's superiority over contemporary neural and hybrid models in terms of generalization and transferability.

Related papers

• Neural Symbollic Regression Using Deep Learning and Sparse Modelling [0.0]
  Symbolic Regression seeks to find succinct mathematical expressions that represent fundamental relationships within data.<n>Traditional methods like Genetic Programming face challenges with scalability and are highly sensitive to noise.<n>We present a Neural Symbolic Regression framework that treats neural networks as functional preconditioners for symbolic discovery.
  arXiv  Detail & Related papers  (2026-09-01T11:46:28Z)
• Improving Set Function Approximation with Quasi-Arithmetic Neural Networks [23.73257235603082]
  We propose quasi-arithmetic neural networks (QUANNs)<n>QUANNs are universal approximators for a broad class of common set-function decompositions.<n>We provide a theoretical analysis showing that, QUANNs are universal approximators for a broad class of common set-function decompositions.
  arXiv  Detail & Related papers  (2026-02-04T18:36:31Z)
• Neuronal Group Communication for Efficient Neural representation [85.36421257648294]
  This paper addresses the question of how to build large neural systems that learn efficient, modular, and interpretable representations.<n>We propose Neuronal Group Communication (NGC), a theory-driven framework that reimagines a neural network as a dynamical system of interacting neuronal groups.<n>NGC treats weights as transient interactions between embedding-like neuronal states, with neural computation unfolding through iterative communication among groups of neurons.
  arXiv  Detail & Related papers  (2025-10-19T14:23:35Z)
• A Neuroscience-Inspired Dual-Process Model of Compositional Generalization [12.494200165412186]
  We propose textscMirage, a neuro-inspired dual-process model.<n>It combines a fast, intuitive System1'' (a meta-trained Transformer) with a deliberate, rule-based System2'' (a Engine)<n>Mirage achieves $>$99% accuracy on all splits of the SCAN benchmark in a task-agnostic setting.
  arXiv  Detail & Related papers  (2025-07-25T01:02:07Z)
• NeSyCoCo: A Neuro-Symbolic Concept Composer for Compositional Generalization [17.49136753589057]
  NeSyCoCo is a neuro-symbolic framework that generates symbolic representations and maps them to differentiable neural computations. Our framework achieves state-of-the-art results on the ReaSCAN and CLEVR-CoGenT compositional generalization benchmarks.
  arXiv  Detail & Related papers  (2024-12-20T05:48:58Z)
• Mastering Symbolic Operations: Augmenting Language Models with Compiled Neural Networks [48.14324895100478]
  "Neural architecture" integrates compiled neural networks (CoNNs) into a standard transformer. CoNNs are neural modules designed to explicitly encode rules through artificially generated attention weights. Experiments demonstrate superiority of our approach over existing techniques in terms of length generalization, efficiency, and interpretability for symbolic operations.
  arXiv  Detail & Related papers  (2023-04-04T09:50:07Z)
• Permutation Equivariant Neural Functionals [92.0667671999604]
  This work studies the design of neural networks that can process the weights or gradients of other neural networks. We focus on the permutation symmetries that arise in the weights of deep feedforward networks because hidden layer neurons have no inherent order. In our experiments, we find that permutation equivariant neural functionals are effective on a diverse set of tasks.
  arXiv  Detail & Related papers  (2023-02-27T18:52:38Z)
• Learning Dynamics and Structure of Complex Systems Using Graph Neural Networks [13.509027957413409]
  We trained graph neural networks to fit time series from an example nonlinear dynamical system. We found simple interpretations of the learned representation and model components. We successfully identified a graph translator' between the statistical interactions in belief propagation and parameters of the corresponding trained network.
  arXiv  Detail & Related papers  (2022-02-22T15:58:16Z)
• Dynamic Inference with Neural Interpreters [72.90231306252007]
  We present Neural Interpreters, an architecture that factorizes inference in a self-attention network as a system of modules. inputs to the model are routed through a sequence of functions in a way that is end-to-end learned. We show that Neural Interpreters perform on par with the vision transformer using fewer parameters, while being transferrable to a new task in a sample efficient manner.
  arXiv  Detail & Related papers  (2021-10-12T23:22:45Z)
• Sequence-to-Sequence Learning with Latent Neural Grammars [12.624691611049341]
  Sequence-to-sequence learning with neural networks has become the de facto standard for sequence prediction tasks. While flexible and performant, these models often require large datasets for training and can fail spectacularly on benchmarks designed to test for compositional generalization. This work explores an alternative, hierarchical approach to sequence-to-sequence learning with quasi-synchronous grammars.
  arXiv  Detail & Related papers  (2021-09-02T17:58:08Z)
• SyGNS: A Systematic Generalization Testbed Based on Natural Language Semantics [39.845425535943534]
  We propose a Systematic Generalization testbed based on Natural language Semantics (SyGNS) We test whether neural networks can systematically parse sentences involving novel combinations of logical expressions such as quantifiers and negation. Experiments show that Transformer and GRU models can generalize to unseen combinations of quantifiers, negations, and modifier that are similar to given training instances in form, but not to the others.
  arXiv  Detail & Related papers  (2021-06-02T11:24:41Z)
• Compositional Generalization via Neural-Symbolic Stack Machines [99.79811868836248]
  We propose the Neural-Symbolic Stack Machine (NeSS) to tackle limitations in compositional generalization. NeSS combines the expressive power of neural sequence models with the recursion supported by the symbolic stack machine. NeSS achieves 100% generalization performance in four domains.
  arXiv  Detail & Related papers  (2020-08-15T06:23:20Z)
• Neural Complexity Measures [96.06344259626127]
  We propose Neural Complexity (NC), a meta-learning framework for predicting generalization. Our model learns a scalar complexity measure through interactions with many heterogeneous tasks in a data-driven way.
  arXiv  Detail & Related papers  (2020-08-07T02:12:10Z)
• Compositional Generalization by Learning Analytical Expressions [87.15737632096378]
  A memory-augmented neural model is connected with analytical expressions to achieve compositional generalization. Experiments on the well-known benchmark SCAN demonstrate that our model seizes a great ability of compositional generalization.
  arXiv  Detail & Related papers  (2020-06-18T15:50:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.