'Memory States' from Almost Nothing: Representing and Computing in a Non-associative Algebra
Stefan Reimann

TL;DR
This paper introduces a non-associative algebraic framework for representing and computing memory sequences in high-dimensional space, capturing temporal structure and effects like recency and primacy without auxiliary order markers.
Contribution
It proposes a novel non-associative bundling method that preserves sequence order and temporal information inherently, unlike traditional associative models.
Findings
Replicates the Serial Position Curve observed in cognitive experiments.
Differentiates between recency and primacy effects through distinct memory states.
Supports long sequences with sparse, order-preserving representations.
Abstract
This note presents a non-associative algebraic framework for the representation and computation of information items in high-dimensional space. This framework is consistent with the principles of spatial computing and with the empirical findings in cognitive science about memory. Computations are performed through a process of multiplication-like binding and non-associative interference-like bundling. Models that rely on associative bundling typically lose order information, which necessitates the use of auxiliary order structures, such as position markers, to represent sequential information that is important for cognitive tasks. In contrast, the non-associative bundling proposed allows the construction of sparse representations of arbitrarily long sequences that maintain their temporal structure across arbitrary lengths. In this operation, noise is a constituent element of the…
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
TopicsComputability, Logic, AI Algorithms · Cognitive Computing and Networks
