arXiv Computation and Language By Jianjie Zheng, Peng Lai, Sijie Cheng, Jiehui Zhao, Lei Yang, Guanhua Chen

ROAM: Robust Organization of Atomic Memories for Agents through Semantic Relations

Read the original on arXiv Computation and Language →

ROAM is a relation‑guided framework for managing atomic memories in long‑term language‑model agents. It classifies atom pairs as independent, equivalent, subsuming, or conflicting, then organizes observations into Primary and Evidence roles, fusing complementary details into compact views. Only Primary views are retrieved for answering, which reduces redundancy and improves answer accuracy by up to 29.8 percentage points across models and settings.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Computation and Language
2d ago

AtomMem: Building Simple and Effective Memory System for LLM Agents via Atomic Facts

AtomMem is a long‑term memory system for large language models that stores high‑value atomic facts extracted from long‑form interactions. It organizes these facts into hierarchical event structures and temporal profiles, enabling coherent episodic context and dynamic tracking of user attributes. During retrieval, an associative memory graph connects fragmented memories, and experiments on the LoCoMo benchmark show state‑of‑the‑art performance across reasoning tasks.

By Yanyu Yao, Shangze Li, Zhi Zheng, Hui Zheng, Qi Liu, Tong Xu, Enhong Chen
arXiv Machine Learning
Sep 4

MemoryLACE: Memory Lifecycle-Aware Consolidation and Evidence Retrieval

MemoryLACE (MemLACE) is a lightweight memory framework that explicitly models the lifecycle of textual evidence—capturing sparse merge, supersession, and contradiction relations—while preserving atomic natural‑language memories and their provenance. Unlike traditional systems that retrieve memories independently, MemLACE reconstructs relation‑aware evidence units that expose current, historical, supporting, and conflicting evidence for downstream reasoning. In benchmark evaluations (BEAM and StructMemEval) using both open‑weight and proprietary LLM backbones, MemLACE achieves the highest overall performance among same‑backbone comparisons and reduces BEAM runtime by 66.6% compared to the strongest reflective‑memory baseline, Hindsight.

By Meriem Yacoubi, Pia Schmidt, Nenad Petrovic, Ahmed Frikha, Martin Kirchhoff, Alois Knoll
arXiv AI
Sep 11

What Should an Agent Forget? Separating What Is Stored from What Is Used

The paper introduces RD-Forget, a training‑free framework that separates what a persistent language agent stores from what it uses at answer time. It keeps a source archive of all observations while a query‑conditioned memory view filters evidence relevant to the current question, using a frozen language‑model curator to group facts into semantic slots and preserve multi‑hop relations. The approach employs rate‑distortion principles to stay within a memory budget and demonstrates improvements across conversational memory, knowledge updating, fact consolidation, long‑context reasoning, and personalization tasks.

By Yuhang Li, Yuchen Li
arXiv AI
Sep 10

AMA: Adaptive Memory via Multi-Agent Collaboration

The paper introduces AMA, a framework that uses multiple agents—Constructor, Retriever, Judge, and Refresher—to manage memory for large language model agents. AMA’s hierarchical memory design dynamically adjusts retrieval granularity to match task complexity, while the Judge and Refresher ensure relevance, consistency, and timely updates. Experiments on long-context benchmarks show AMA outperforms existing baselines and cuts token usage by about 80% compared to full-context approaches.

By Weiquan Huang, Zixuan Wang, Hehai Lin, Sudong Wang, Bo Xu, Qian Li, Beier Zhu, Linyi Yang, Chengwei Qin
arXiv Computation and Language
Oct 28

TrawMem: Reframing Agent Memory as Task-Oriented Role-Adaptive Workspaces

TrawMem redefines agent memory systems as Task‑Oriented Role‑Adaptive Workspaces, selecting and organizing memories by their roles in task solving rather than mere relevance. It structures interaction histories into local threads and jointly selects complementary memories to build task‑specific workspaces. Experiments on LoCoMo and MemGallery show consistent macro‑F1 gains of 2.23–3.14 points and improved LLM‑Judge scores with fewer context tokens.

By Mingyu Zhang, Zixu Li, Zhiheng Fu, Zhiwei Chen, Jinhe Bi, Yupeng Hu