Agent memory retrieval policies impact accuracy with stale facts
StaleBench: Isolating Stale Retrieval in Agent Memory, and Pricing the Fix
Computation and LanguageArtificial IntelligenceInformation Retrieval
Summary
When a computer agent remembers facts over time, it might store multiple versions of the same fact, like which team a player is on now. The authors study how agents often retrieve outdated information mistakenly because old and new facts look similar. They created a benchmark with real data to show that usual ways to measure retrieval can be misleading, and they propose a new metric to better identify fresh facts. Their work also explores how different systems handle updates and how resolving entities helps keep retrieved information current.
What this means in practice
- •For knowledge base developers: Improve memory update policies to reduce stale fact retrieval in AI assistants by using metrics that better detect fresh information.
- •For chatbot engineers: Design AI chatbots that avoid outdated answers by implementing entity resolution during both fact storage and retrieval.
Authors
S M Mahbub Murshed
Abstract
An agent that stores facts over time eventually stores several versions of the same fact. Asked a value-agnostic question - "which team does X play for now?" - a similarity retriever cannot prefer the current version, because every version matches the entity the query names. StaleBench isolates this stale-retrieval failure on 892 real updating facts, with currency labels from the source (Wikidata validity years via TempLAMA), never from a retrieval score. Our central result is that retrieval metrics can rank memory policies backwards: a retention policy and its retain-everything control return the identical statement at rank 1 for every test query, yet differ by 29.5 and 65.6 points in reader accuracy on two readers when no date is shown. Contamination@5, the metric we add, ranks them correctly where current@1 and current@5 do not. Withdrawing the lexical anchor that statements carry costs deployed keying mechanisms tens of points of freshness; entity resolution on both the write path and the query recovers most of the loss. Three deployed systems (Mem0, Graphiti, LangMem) and a reimplemented ERASE each handle supersession differently, and no single scoring convention describes all four. We release the data, a frozen evaluator, and reference baselines.