SRMU is a relevance-gated update rule with temporal decay for VSA streaming associative memories that filters redundant and stale information, yielding 12.6% higher memory similarity and 53.5% lower cumulative memory magnitude.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
SRMU: Relevance-Gated Updates for Streaming Hyperdimensional Memories
SRMU is a relevance-gated update rule with temporal decay for VSA streaming associative memories that filters redundant and stale information, yielding 12.6% higher memory similarity and 53.5% lower cumulative memory magnitude.