arXiv AI

Towards Version-aware Operations and Transaction Memories for Multi-layer MeMo

arXiv:2606. 24040v1 Announce Type: cross Abstract: MeMo proposes language models with explicit multi-layer correlation matrix memories (CMMs), where memorization, retrieval, and forgetting are architectural operations.

Hugging Face Trending Papers
Jul 29

ForgetBench: Benchmarking Forgetting Dynamics of Long-Term Parametric Memory in Language Models

Large language models (LLMs) have demonstrated strong capabilities in knowledge acquisition and reasoning, yet their ability to retain previously acquired knowledge under repeated updates remains insufficiently understood. Existing evaluation paradigms primarily focus on single-step reasoning or static knowledge editing, which fail to capture the temporal dynamics of knowledge retention and degradation during continual model modification.

Hugging Face Trending Papers
Jul 30

ChronoMem: Version Control and Semantic Rollback for Large Language Model Agent Memory

LLM agents increasingly rely on long-term memory to support multi-session interaction and personalization. However, existing agent memory systems are designed around forward-only evolution, continuously accumulating, consolidating, and overwriting knowledge, with no principled mechanism to inspect, version, or revert prior states.

arXiv AI
Aug 12

From Faulty Memories to Corrected Actions: Dependency-Guided Rollback Repair for Memory-Augmented Agents

arXiv:2608. 10502v1 Announce Type: new Abstract: Persistent memory lets language-model agents reuse information across sessions, but it also makes errors durable: a poisoned, stale, or misattributed record can alter reasoning, tool use, answers, and subsequent memory writes.

By Caili Yu, Yiqi Wang, Jiaqi Zhang, Yiqun Duan, Mingkai Zheng, Zhangkai Wu, Kaize Shi, Taotao Cai
arXiv Computation and Language
Sep 22

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

RPMem introduces a two‑stage architecture that compiles each session into a model‑independent latent memory and then consolidates it with retained memory via a task‑trained recurrent gate. The consolidated memory is mapped to backbone‑specific low‑rank adaptation (LoRA) parameters, enabling the memory to transfer when the backbone is replaced. Across three long‑term memory benchmarks and five diverse backbones, RPMem achieves broad generalization with near‑constant update cost and memory footprint, outperforming existing parametric and text‑based baselines on the PERMA benchmark.

By Fanyu Zhao, Ruike Cao, Liang Dong, Fugen Yao, Jian Xu, Guanjun Jiang, Han Zhang, Yifei Zhao, Yinsheng Li