A Computational Model of Learning and Memory Using Structurally Dynamic Cellular Automata
Jeet Singh

TL;DR
This paper introduces a bio-inspired computational model using structurally dynamic cellular automata to simulate learning and memory, demonstrating near-optimal decision-making and context-dependent memory with high efficiency.
Contribution
It presents a novel, minimal model combining cellular automata with dynamic graph structures to emulate key cognitive functions like learning and memory.
Findings
Model re-discovers reward states after one training
Avoids complex penalty configurations
Exhibits exploratory behaviors in sparse rewards
Abstract
In the fields of computation and neuroscience, much is still unknown about the underlying computations that enable key cognitive functions including learning, memory, abstraction and behavior. This paper proposes a mathematical and computational model of learning and memory based on a small set of bio-plausible functions that include coincidence detection, signal modulation, and reward/penalty mechanisms. Our theoretical approach proposes that these basic functions are sufficient to establish and modulate an information space over which computation can be carried out, generating signal gradients usable for inference and behavior. The computational method used to test this is a structurally dynamic cellular automaton with continuous-valued cell states and a series of recursive steps propagating over an undirected graph with the memory function embedded entirely in the creation and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSparse Evolutionary Training
