arXiv:2606. 26511v1 Announce Type: cross Abstract: Retrieval-augmented generation (RAG) gives agents access to accumulated knowledge, but has no model of time.
By Neeraj Yadav
The paper introduces MERIT, a benchmark that evaluates the marginal benefit of long‑term memory for tool‑using large language model agents while explicitly accounting for cost. MERIT provides episodic tool‑use tasks across three domains, verifies dependence on earlier‑episode facts, and measures memory operations in tokens and dollars. Experiments on GPT‑4.1‑mini, Claude Haiku 4.5, and Claude Sonnet 5 show that memory can significantly improve task success, but its utility varies widely across models and memory implementations, and full replay is rarely cost‑effective.
By Shweta Mishra, Shashank Mishra
arXiv:2608.17050v3 Announce Type: replace-cross
Abstract: Methods for improving knowledge use in large language models typically fall into two regimes. Non-parametric retrieval offers flexible access...
By Mingyuan Li, Guangsheng Yu, Xu Wang, Shaoxiong Ji
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...
By Bowen Qin, Yao Lu
APEX-EM is a non‑parametric experience memory that stores full procedural‑episodic traces in a typed Procedural Knowledge Graph and retrieves them via semantic search, structural‑signature matching, and graph traversal. It uses a Plan‑Retrieve‑Generate‑Iterate‑Ingest workflow to produce, quality‑gate, and commit experiences, indexing both successes and failures so the agent learns what to reuse and what to avoid. Evaluations on five benchmarks with a shared GPT‑4o backbone show significant performance gains, such as +7.6 pp on BigCodeBench transfer and +1.4 pp on Lifelong Agent Bench, demonstrating that the memory adds to model capability rather than replacing it.
By Pratyay Banerjee, Masud Moshtaghi, Ankit Chadha
The paper introduces REM (Reusable Experience Memory), a framework that manages the lifecycle of experience for large language model agents performing long-horizon coding tasks. REM consolidates completed trajectories into compact, phase-structured documents, injects them at task start, and evicts them after a single exposure, making the memory system responsive to the agent’s needs. Experiments on repository-level bug fixing show REM outperforms state‑of‑the‑art memory systems in retrieval accuracy and task resolution while reducing cost.
By Xinyi Lisa Chen, Pedro Herrero-Vidal, Xiaohan Chen, Xiaojing Yu, Cris Liu, Bingqing Song, Bin Xu, Suleiman A. Khan, You-Lin Chen
The paper investigates how Engram-style hashed memory can be transferred between different language model backbones. By freezing a memory table trained on a source model and attaching it to a target model with only a lightweight reader, the authors find that both the memory content and correct addressing are important, but the reader must be aligned to the target to make the memory useful. In question‑answering experiments, a dual‑layer, four‑branch reader nearly matches same‑model performance, and when the reader interface is directly compatible, the frozen memory alone provides substantial benefit, with optional reader adaptation offering further gains.
By Mingyuan Li, Guangsheng Yu, Xu Wang, Shaoxiong Ji
MemCut introduces a benchmark to test user-requested forgetting in large language model agents, featuring 456 hand-designed secrets embedded in long-horizon conversations with fully annotated evidence trails. The benchmark defines two recovery metrics—native and residual—to assess how well secrets can be retrieved after deletion. Experiments across five memory designs and four LLMs show that deletion reduces native recovery more than residual recovery, highlighting candidate coverage as a key bottleneck.
By Cheng Zhang, Xuanning Cao, Zhicheng Zheng, Hui Xiong
arXiv:2610.08586v1 Announce Type: new
Abstract: Long conversational agents have become essential in our daily lives. They must remember what was said long back in order to help us efficiently complet...
By Sujato Dutta, Sreekruthy Tummala, Shashank Vanga, Ayushmi Pavani
The paper introduces Multimodal Filesystem Memory (MFM), a memory architecture for long‑horizon embodied agents that stores episodic, spatial, semantic, procedural, and working memories. MFM uses searchable textual records to link these representations to multimodal episodes, enabling agents to retrieve past experiences via contextual cues and revisit original observations for missing details. Experiments on long‑horizon Minecraft and computer‑use tasks show that MFM improves performance over three base models, achieving higher milestone completion and reward scores compared to baselines.
By Chloe Su, Jiahan Li, Zhenting Qi, Chaoran Cheng, Haoyu Chen, Sejoon Jun, Weirui Ye, Yilun Du
The paper introduces MERIT, a training‑free agent that uses an online dual‑polarity memory of oracle‑verified corrections and failed attempts to improve LLM agent repair without updating parameters. MERIT retrieves only finalized memories, classifies failures, and employs a hybrid lexical‑dense retriever before the frozen model generates revisions. Experiments with Qwen2.5‑7B‑Instruct show that MERIT raises execution accuracy on the Spider benchmark from 66.34 % to 69.79 % and on BIRD from 47.35 % to 48.44 %, with varying evidence across datasets.
By Khang Nhat Hoang Vo, Tam Minh Chu, Anh Trac Duc Dinh, Thuyen Vinh Ha Bui, Tho Quan
Agent Zero Memory is a provenance‑aware long‑term memory system for large language model agents that distills user interactions into three parallel memory structures: an episodic timeline, an associative entity‑event knowledge graph, and a semantic, citation‑locked hierarchical documentary memory. Retrieval is performed via an intent gate, source router, and concurrent searches across the three systems, producing integrated, cited answers that exclude fabrication and require evidence the reader has opened. The system achieves state‑of‑the‑art performance on LongMemEval (95.60%) and LoCoMo (93.60%) while offering a favorable accuracy‑cost‑latency trade‑off across multiple backbone LLMs.
By Ming Wu, Pengyuan Zhu