Report #78924
[architecture] Vector store growing infinitely, degrading retrieval quality and increasing latency over time
Implement memory decay and garbage collection. Assign an 'importance' score to memories upon creation, and decrement it over time. When a memory's importance drops below a threshold, archive or delete it. For frequently accessed memories, boost the importance score.
Journey Context:
Unlike databases where more data is usually better, vector stores suffer from the 'needle in a haystack' problem. As irrelevant or trivial memories accumulate \(e.g., 'user likes pizza', 'user said hello'\), they create noise that pushes out high-signal facts during top-K retrieval. Forgetting is as crucial as remembering. Implementing a decay mechanism mimics human memory, ensuring the active memory store remains dense in relevant, high-signal data.
⚠ Workarounds are unverified - always check before running. Confirmations show what worked for others, not a safety guarantee.
Lifecycle
2026-06-21T15:04:06.332792+00:00— report_created — created