SRMU: Relevance-Gated Updates for Streaming Hyperdimensional Memories
Not on the map. Why?
Abstract (arXiv)
Sequential associative memories (SAMs) are difficult to build and maintain in real-world streaming environments, where observations arrive incrementally over time, have imbalanced sampling, and non-stationary temporal dynamics. Vector Symbolic Architectures (VSAs) provide a biologically-inspired framework for building SAMs. Entities and attributes are encoded as quasi-orthogonal hyperdimensional vectors and processed with well defined algebraic operations. Despite this rich framework, most VSA systems rely on simple additive updates, where repeated observations reinforce existing information even when no new information is introduced. In non-stationary environments, this leads to the persistence of stale information after the underlying system changes. In this work, we introduce the Sequential Relevance Memory Unit (SRMU), a domain- and cleanup-agnostic update rule for VSA-based SAMs. The SRMU combines temporal decay with a relevance gating mechanism. Unlike prior approaches that solely rely on cleanup, the SRMU regulates memory formation by filtering redundant, conflicting, and stale information before storage. We evaluate the SRMU on streaming state-tracking tasks that isolate non-uniform sampling and non-stationary temporal dynamics. Our results show that the SRMU increases memory similarity by 12.6% and reduces cumulative memory magnitude by 53.5%. This shows that the SRMU produces more stable memory growth and stronger alignment with the ground-truth state.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 18 references that are in the map. First posted on arXiv 16 Apr 2026.
Builds on
11 of 18 references.
References · 11
- 2019Event-based Vision: A Surveycited by 1,016
- 2020Hopfield Networks is All You Needcited by 475
- 2021A Survey on Hyperdimensional Computing aka Vector Symbolic Architectures, Part I: Models and Data Transformationscited by 99
- 2021A Survey on Hyperdimensional Computing aka Vector Symbolic Architectures, Part II: Applications, Cognitive Models, and Challengescited by 69
- 2021Computing on Functions Using Randomized Vector Representationscited by 41
- 2018A theory of sequence indexing and working memory in recurrent neural networkscited by 29
- 2022Neuromorphic Visual Scene Understanding with Resonator Networkscited by 17
- 2020Autonomous Navigation in Unknown Environments with Sparse Bayesian Kernel-based Occupancy Mappingcited by 4
- 2024Brain Inspired Probabilistic Occupancy Grid Mapping with Vector Symbolic Architecturescited by 2
- 2025Generalizable Reinforcement Learning with Biologically Inspired Hyperdimensional Occupancy Grid Maps for Exploration and Goal-Directed Path Planningcited by 2
- 2024On the Role of Noise in Factorizers for Disentangling Distributed Representationscited by 1
Built on by
Not cited yet.