The Price of Meaning: Why Every Semantic Memory System Forgets
Sambartha Ray Barman, Andrey Starenky, Sofia Bodnar, Nikhil Narasimhan, Ashwin Gopinath

TL;DR
This paper proves that all semantic memory systems in AI face an unavoidable tradeoff: enabling generalisation leads to interference, forgetting, and false recall, which are inherent to their geometric structure.
Contribution
It formalizes the fundamental tradeoff in semantic memory systems, showing that interference and forgetting are unavoidable consequences of their geometric organization.
Findings
Semantic representations with finite effective rank are necessary for usefulness.
Finite local dimension causes positive competitor mass, leading to interference.
Memory retention decays to zero over time, following a power-law pattern.
Abstract
Every major AI memory system in production today organises information by meaning. That organisation enables generalisation, analogy, and conceptual retrieval -- but it comes at a price. We prove that the same geometric structure enabling semantic generalisation makes interference, forgetting, and false recall inescapable. We formalise this tradeoff for \textit{semantically continuous kernel-threshold memories}: systems whose retrieval score is a monotone function of an inner product in a semantic feature space with finite local intrinsic dimension. Within this class we derive four results: (1) semantically useful representations have finite effective rank; (2) finite local dimension implies positive competitor mass in retrieval neighbourhoods; (3) under growing memory, retention decays to zero, yielding power-law forgetting curves under power-law arrival statistics; (4) for…
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.
