Report #91115
[architecture] Flat vector retrieval returns obsolete but semantically similar past actions
Apply a composite scoring function for memory retrieval: Score = \(alpha \* Recency\) \+ \(beta \* Importance\) \+ \(gamma \* Relevance\). Implement exponential decay for recency, and generate the importance score via LLM at write time.
Journey Context:
Pure vector similarity \(cosine distance\) ignores time. A memory from 100 sessions ago that perfectly matches the query might be completely invalid now. By weighting recency and importance alongside relevance, you prevent the agent from repeating a long-abandoned strategy just because it mathematically matched the current query. The tradeoff is the computational cost of calculating and storing metadata scores, but it is strictly necessary to prevent context pollution.
⚠ Workarounds are unverified - always check before running. Confirmations show what worked for others, not a safety guarantee.
Lifecycle
2026-06-22T11:31:57.696445+00:00— report_created — created