SRMU: Relevance-Gated Updates for Streaming Hyperdimensional Memories
Shay Snyder (1), Andrew Capodieci (2), David Gorsich (3), Maryam Parsa (1) ((1) George Mason University, (2) Neya Robotics, (3) US Army Ground Vehicle Systems Center)

TL;DR
This paper introduces SRMU, a relevance-gated update rule for streaming associative memories that improves stability and relevance in non-stationary environments by filtering redundant and stale information.
Contribution
The SRMU method combines temporal decay with relevance gating to enhance VSA-based SAMs, addressing issues of stale information in streaming environments.
Findings
SRMU increases memory similarity by 12.6%.
SRMU reduces cumulative memory magnitude by 53.5%.
SRMU produces more stable memory growth and better ground-truth alignment.
Abstract
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.…
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.
