SRMU: Relevance-Gated Updates for Streaming Hyperdimensional Memories
AI 摘要
SRMU通过相关性门控更新机制,解决了向量符号架构在流式环境中记忆的稳定性问题。
主要贡献
- 提出SRMU:一种适用于VSA的、领域无关的记忆更新规则
- 结合时间衰减和相关性门控,过滤冗余、冲突和过时信息
- 在流式状态跟踪任务上验证了SRMU的有效性
方法论
基于向量符号架构,设计SRMU更新规则,利用时间衰减和相关性门控机制进行记忆更新,并进行实验验证。
原文摘要
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.