arXiv AI
Aug 10
TEPA: Revoking Stale Memories for Conflict-Robust Language Agents
arXiv:2608. 07429v1 Announce Type: new Abstract: Long-term memory enables language agents to reuse past facts, preferences, and task experience.
The Memory Trust Gap: Capability-Dependent Failures in Persistent-Memory Agents
The paper investigates how persistent memory in AI agents can lead to over‑trust in stale facts, creating a "Memory Trust Gap" that worsens as model capability increases. Using a benchmark with Benefit and Safety suites across Qwen3 models of varying sizes, the authors show that larger models are more prone to harmful over‑trust, especially when metadata is absent or misleading. They also demonstrate that mitigation strategies such as exposing metadata or pre‑resolving conflicts improve accuracy, but the effectiveness depends on model size and dataset.
Related stories
arXiv AI
Sep 30
Authority Before Utility: Non-Compensatory Control for Persistent LLM Memory
arXiv:2609.37474v1 Announce Type: new Abstract: Persistent memory creates a control problem that retrieval relevance alone does not solve: a memory can remain highly useful after an update, deletion,...
arXiv Machine Learning
Jun 25
Reclaim Evaluation: A Lossy Memory Is Worse Than an Empty One
arXiv:2606. 25449v1 Announce Type: cross Abstract: A language model's memory can be worse than having no memory at all.
arXiv Computation and Language
1d ago
Memories That Outlive Their Reasons: Dependency-Tethered Memory for Tool-Using LLM Agents
arXiv:2610.25123v2 Announce Type: replace Abstract: Agents now act on the Web, publishing packages, models and datasets through registry APIs, and remembering past verifications spares them the work....
arXiv Computation and Language
Aug 27
When Stale Constraints Go Unchecked: Budgeted Verification Failures in Inherited Agent Memory
The paper investigates how agents that inherit consolidated memory can mistakenly rely on constraints that were once true but have since been superseded by newer records. By modeling supersession explicitly and limiting verification to two records, the study shows that native allocation often leads to stale-consistent decisions, while reallocating one verification slot to the critical provenance path markedly improves consistency. The results suggest that memory systems may need separate freshness or supersession signals beyond relevance to avoid such errors.
Hugging Face Trending Papers
Jun 24
Reclaim Evaluation: A Lossy Memory Is Worse Than an Empty One
A language model's memory can be worse than having no memory at all. Give a model a memory that kept a wrong conclusion but dropped the work behind it, and it emits that stale value as a confident answer; give the same model an empty memory and it abstains.
arXiv AI
Sep 7
Forgetting Without Restarting: Execution-State Unlearning for Stateful LLM Agents
arXiv:2609. 04875v1 Announce Type: cross Abstract: Long-running LLM agents are stateful: beyond the transcript they accrete compressed summaries, plaintext memory, pending tool plans, and, under every serving API, a KV cache.
arXiv AI
Oct 15
Suggested Is Not Superseded: A Pre-Registered Evaluation of a System-One Model as a Memory-Retirement Gate
arXiv:2610.15710v1 Announce Type: new Abstract: Long-term memory for assistants needs a gate that decides when a new utterance retires an old stored claim. Benchmark labels for this step mark a pair...
arXiv Computation and Language
Sep 23
MoM: Memory of Memory
arXiv:2609.25054v1 Announce Type: new Abstract: For a long-horizon LLM agent, the memory question is not what was once recorded but what \emph{currently holds}. Most designs answer it only indirectly...
arXiv AI
Aug 14
Governed Persistent Memory: Source-Bound State Semantics and Fail-Closed Release for Long-Horizon Agents
arXiv:2608. 12476v1 Announce Type: new Abstract: Long-term agent memory is usually treated as select--store--retrieve, but retrieval does not decide whether contradictory, superseded, retracted, deleted, or stale records may support an outgoing claim.
arXiv AI
Aug 24
Temporal Validity on Real Software Histories: Eliminating Stale-Fact Errors in Code-Assistant Memory over GitHub Fixes
The paper evaluates a deterministic supersession memory, MemStrata, for retrieval‑augmented generation (RAG) systems on real software history. Using 707 GitHub issues, the authors extracted 130 clean atomic state transitions where a single value changes from pre‑fix to post‑fix. MemStrata achieved 0.91 answer accuracy versus 0.57–0.59 for standard RAG, eliminating stale‑fact errors that RAG returned 36–38% of the time, while maintaining comparable retrieval latency.
arXiv AI
Sep 25
Stale Does Not Mean Unsafe: Guard Precision for Tool-Using LLM Agents under Infrastructure State Races
The paper investigates how tool‑using language‑model agents can safely commit changes to infrastructure when external state may change between read and commit. By distinguishing invalidating races from predicate‑preserving and irrelevant ones, the authors evaluate three commit‑time guard granularities—global epoch, read‑set version, and semantic commit predicate—using a deterministic simulator and three quantized model families. The study finds that only the complete predicate guard consistently eliminates unsafe commits, while freshness‑based guards block a large proportion of benign races and model‑side signals fail to replace precise semantic enforcement.