Modular Neural Computer
- URL: http://arxiv.org/abs/2603.13323v1
- Date: Wed, 04 Mar 2026 16:29:20 GMT
- Title: Modular Neural Computer
- Abstract summary: The Modular Neural Computer (MNC) is a memory-augmented neural architecture for exact computation on variable-length inputs.<n>The architecture is illustrated through three case studies: computing the minimum of an array, sorting an array in place, and executing A* search on a fixed problem instance.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper introduces the Modular Neural Computer (MNC), a memory-augmented neural architecture for exact algorithmic computation on variable-length inputs. The model combines an external associative memory of scalar cells, explicit read and write heads, a controller multi-layer perceptron (MLP), and a homogeneous set of functional MLP modules. Rather than learning an algorithm end to end from data, it realizes a given algorithm through analytically specified neural components with fixed interfaces and exact behavior. The control flow is represented inside the neural computation through one-hot module gates, where inactive modules are inhibited. Computation unfolds as a sequence of memory transformations generated by a fixed graph. The architecture is illustrated through three case studies: computing the minimum of an array, sorting an array in place, and executing A* search on a fixed problem instance. These examples show that algorithmic procedures can be compiled into modular neural components with external memory while preserving deterministic behavior and explicit intermediate state.
Related papers
- A Computational Model of Learning and Memory Using Structurally Dynamic Cellular Automata [0.0]
This paper proposes a mathematical and computational model of learning and memory based on a small set of bio-plausible functions.<n> Experimental results show that the model can make near-optimal choices to re-discover a reward state after a single training run.
arXiv Detail & Related papers (2024-12-20T17:26:17Z) - Emergence in non-neural models: grokking modular arithmetic via average gradient outer product [16.911836722312152]
We show that grokking is not specific to neural networks nor to gradient descent-based optimization.<n>We show that this phenomenon occurs when learning modular arithmetic with Recursive Feature Machines.<n>Our results demonstrate that emergence can result purely from learning task-relevant features.
arXiv Detail & Related papers (2024-07-29T17:28:58Z) - Enhancing Length Extrapolation in Sequential Models with Pointer-Augmented Neural Memory [66.88278207591294]
We propose Pointer-Augmented Neural Memory (PANM) to help neural networks understand and apply symbol processing to new, longer sequences of data.
PANM integrates an external neural memory that uses novel physical addresses and pointer manipulation techniques to mimic human and computer symbol processing abilities.
arXiv Detail & Related papers (2024-04-18T03:03:46Z) - In-Context Language Learning: Architectures and Algorithms [73.93205821154605]
We study ICL through the lens of a new family of model problems we term in context language learning (ICLL)
We evaluate a diverse set of neural sequence models on regular ICLL tasks.
arXiv Detail & Related papers (2024-01-23T18:59:21Z) - A Recursively Recurrent Neural Network (R2N2) Architecture for Learning
Iterative Algorithms [64.3064050603721]
We generalize Runge-Kutta neural network to a recurrent neural network (R2N2) superstructure for the design of customized iterative algorithms.
We demonstrate that regular training of the weight parameters inside the proposed superstructure on input/output data of various computational problem classes yields similar iterations to Krylov solvers for linear equation systems, Newton-Krylov solvers for nonlinear equation systems, and Runge-Kutta solvers for ordinary differential equations.
arXiv Detail & Related papers (2022-11-22T16:30:33Z) - Neural-Symbolic Integration: A Compositional Perspective [8.566457170664926]
The question of how to integrate a neural and a symbolic system in a emphcompositional manner remains open.
Our work seeks to fill this gap by treating these two systems as black boxes to be integrated as modules into a single architecture.
We are able to show that a symbolic module can be cleanly integrated with a neural module, and facilitate the latter's efficient training.
arXiv Detail & Related papers (2020-10-22T17:55:44Z) - Neural Function Modules with Sparse Arguments: A Dynamic Approach to
Integrating Information across Layers [84.57980167400513]
Neural Function Modules (NFM) aims to introduce the same structural capability into deep learning.
Most of the work in the context of feed-forward networks combining top-down and bottom-up feedback is limited to classification problems.
The key contribution of our work is to combine attention, sparsity, top-down and bottom-up feedback, in a flexible algorithm.
arXiv Detail & Related papers (2020-10-15T20:43:17Z) - RE-MIMO: Recurrent and Permutation Equivariant Neural MIMO Detection [85.44877328116881]
We present a novel neural network for symbol detection in wireless communication systems.
It is motivated by several important considerations in wireless communication systems.
We compare its performance against existing methods and the results show the ability of our network to efficiently handle a variable number of transmitters.
arXiv Detail & Related papers (2020-06-30T22:43:01Z) - Incremental Training of a Recurrent Neural Network Exploiting a
Multi-Scale Dynamic Memory [79.42778415729475]
We propose a novel incrementally trained recurrent architecture targeting explicitly multi-scale learning.
We show how to extend the architecture of a simple RNN by separating its hidden state into different modules.
We discuss a training algorithm where new modules are iteratively added to the model to learn progressively longer dependencies.
arXiv Detail & Related papers (2020-06-29T08:35:49Z)
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.