Agent Memory: What to Store, How to Compress, and Prevent Staleness
Characterize effective long-term memory design for LLM-based AI agents by specifying what categories of state to store (episodic, semantic, procedural), deriving compression and summarization methods that preserve critical constraints, and establishing safeguards that prevent stale or low-quality memory from dominating subsequent decisions.
References
Retrieval-augmented generation is a strong baseline, but open questions include what to store (episodic vs. semantic vs. procedural memory), how to compress and summarize without losing critical constraints, and how to prevent stale or low-quality memory from dominating decision making.
The study does not determine whether the model ignored the memory, weakly weighted it, or corrected an intermediate bias.
The remaining question is which additional conditions turn applicability mismatch into observable, memory-caused error.
These approaches raise a common unresolved question: which information should be remembered, recomputed, or invalidated after an action?
Additionally, managing graph decay---pruning outdated nodes, resolving contradictory constraints, and handling intent pivots---remains an open challenge for long-term deployment.
Length breaks the graph. A graph that adds a node per object instance and an edge per relation per frame is intractable over the minutes-to-hours horizons of real egocentric activity. AMEGO's semantic-free tracklets and FocusGraph's compact textual graphs are the only serious answers so far, and neither offers a general account of how to compress, forget, and re-instantiate graph structure over long horizons.
This raises several questions: how much historical context is needed for reliable interaction, what should be stored or compressed into memory, and how can robots maintain beliefs over partially observed environments without sacrificing control responsiveness? Developing methods that enable robots to incorporate long-term history into decision-making remains an open challenge, and addressing it will be critical for enabling robots to operate reliably in dynamic and continuously evolving environments.
When should episodic memory be trusted? Past experience may become invalid under changes in sensing, policy, traffic rules, or operating conditions, whereas excessive forgetting may cause repeated failures. Memory provenance, confidence decay, conflict tracking, versioning, and revalidation are therefore central challenges for long-term safety memory.
Every distilled prior is critic-derived rather than ground truth, and retrieval quality, staleness, and the propagation of a wrong prior remain open.
The store offers contest, demote and supersede each round and no compared policy uses them, so correction is untested rather than absent.
These methods improve memory organization, revision, and protection but leave open when statements should enter memory.
This is a precision-recall tradeoff inherent to independent fact evaluation, not an artifact of our specific threshold, and motivates chain-aware admission that models inter-fact dependencies at formation time as the primary direction for future work.
What remains open is how an agent should decide when new evidence replaces an older state, when both should coexist, and when uncertainty should be preserved rather than resolved.
Our evaluation is limited to question answering over static corpora, and maintaining anticipatory memories as documents change remains an open problem.
The unresolved issue is distinguishing valid current information from historical records.
These operations motivate a shared research question: under a limited context budget, what information should be carried forward to support subsequent decisions?
We do not evaluate whether learned assembly helps with other memory types, such as semantic memory (facts and rules) or episodic memory of a particular user's history, where the interaction between selected items and their order may differ.