Skip to content

Useful Memories Become Faulty When Continuously Updated by LLMs

May 2026 · arXiv.org · Vol abs/2605.12978 · 10 citations
Computer Science

TL;DR

This work traces the regression to the consolidation step rather than the underlying experience: the same trajectories yield qualitatively different memories under different update schedules, and an episodic-only control that simply retains those trajectories remains competitive with the consolidators the authors test.

Abstract

Learning from past experience benefits from two complementary forms of memory: episodic traces -- raw trajectories of what happened -- and consolidated abstractions distilled across many episodes into reusable, schema-like lessons. Recent agentic-memory systems pursue the consolidated form: an LLM rewrites past trajectories into a textual memory bank that it continuously updates with new interactions, promising self-improving agents without parameter updates. Yet we find that such consolidated memories produced by today's LLMs are often faulty even when derived from useful experiences. As consolidation proceeds, memory utility first rises, then degrades, and can fall below the no-memory baseline. More surprisingly, even when consolidating from ground-truth solutions, GPT-5.4 fails on 54% of a set of ARC-AGI problems it had previously solved without memory. We trace the regression to the consolidation step rather than the underlying experience: the same trajectories yield qualitatively different memories under different update schedules, and an episodic-only control that simply retains those trajectories remains competitive with the consolidators we test. In a controlled ARC-AGI Stream environment that exposes Retain, Delete, and Consolidate actions, agents preserve raw episodes by default and double the accuracy of their forced-consolidation counterparts; disabling consolidation entirely (episodic management only) matches this auto regime. Practically, robust agent memory should treat raw episodes as first-class evidence and gate consolidation explicitly rather than firing it after every interaction. Looking forward, reliable agentic memory will require LLMs that can consolidate without overwriting the evidence they depend on.

View source

Similar papers

#machine learning Preprint Sep 2026

GenMem: Generative Symbolic Memory for Self-Evolving Harness

GenMem is presented, which reformulates memory management as generative symbolic addressing, a multi-level discrete token tuple drawn from a Cartesian-product address space that factorizes a million-scale sparse memory space using fewer than one hundred discrete symbols.

Xin-Ke Jiang, Tao Feng, Wei-Xuan Xu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

The Epistemics of Agent Memory: Measuring, and Governing, the Consolidation Decision in Long-Horizon LLM Agents

A four-phase research program on this consolidation problem whose central finding is a shift in what is measured is a shift in what is measured: from how much an agent remembers, to whether its consolidation decisions are any good, to whether those decisions can be trusted.

Sasank Annapureddy, Anjaneya Prasad Thamatani · 1 citation
#artificial intelligence Preprint Sep 2026

How Linear Attention Remembers

Together, these results reveal how fixed-size recurrent memory supports selective recall despite shared storage, while exposing the interference and capacity limits that distinguish it from token-addressable KV memory.

Kichang Lee, JaeYeon Park, Songkuk Kim et al. · 0 citations
#machine learning Preprint Sep 2026

Learning What to Remember: Long-horizon Counterfactual Memory Optimization

Persistent textual memory allows language models to carry information across long interactions, but learning what to remember is fundamentally a credit-assignment problem. A memory rewrite may only become useful many steps later, while much of the observed utility may be inherited from information already stored before...

Jiaming Tang, Ming-Yan Liu, Armin Sarabi · 0 citations
#artificial intelligence Preprint Sep 2026

RPMem: Learning Long-Term Recurrent Parametric Memory Across Sessions for LLM Agents

RPMem is introduced, a two-stage architecture that compiles each session into a model-independent latent memory through forward computation and selectively integrates it with retained memory via a task-trained recurrent gate, establishing RPMem as a lifecycle-independent parametric memory framework that maintains evolv...

Fan-Yu Zhao, Rui-Ke Cao, Liang Dong et al. · 1 citation · ⚡1

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.