arXiv AI

Memory is Reconstructed, Not Retrieved: Graph Memory for LLM Agents

arXiv:2606. 06036v1 Announce Type: new Abstract: Despite recent progress, LLM agents still struggle with reasoning over long interaction histories.

Hugging Face Trending Papers
Aug 27

GraphMemix: Query-Aware Evidence Forests for Long-Term Multimodal Agent Memory

GraphMemix introduces a combinatorial‑optimization graph memory framework that organizes long‑term multimodal agent memory as query‑aware evidence forests. It constructs candidate graphs by expanding seed memories through schema and semantic relations, then decouples evidence utility from anchor‑conditioned relation verification to reduce redundancy, and finally optimizes a forest‑format memory context within a maximum evidence budget. Experiments on four benchmarks show significant accuracy gains and a new Pareto frontier between accuracy and lifecycle cost.

arXiv AI
Sep 10

EdgeMem: LLM-Free Agent Memory Construction and Retrieval via Evidence-Preserving Multi-Anchor Hypergraph

EdgeMem is a new agent-memory method that preserves original interaction turns and organizes them using complementary content, temporal, and episodic cues via a multi‑anchor hypergraph. It performs lightweight local processing, returning source evidence directly and reserving LLM use only for final answer generation. Experiments on LoCoMo and LongMemEval‑S demonstrate strong retrieval and memory‑grounded question answering, with EdgeMem achieving the highest strict‑judge score among seven systems on LoCoMo while requiring no generative‑LLM calls for construction and retrieval.

By Zeyang Cui, Jiannong Cao, Zhiyuan Wen, Bo Yuan, Junlan Feng, Shengyuan Chen
arXiv AI
Aug 28

GraphMemix: Query-Aware Evidence Forests for Long-Term Multimodal Agent Memory

GraphMemix introduces a combinatorial‑optimization graph memory framework that constructs query‑aware evidence forests for long‑term multimodal agent memory. It expands seed memories via schema and semantic relations, decouples memory support from relation verification to reduce redundancy, and optimizes a forest‑format context within a maximum evidence budget. Experiments on four benchmarks show significant accuracy gains and a new Pareto frontier between accuracy and lifecycle cost.

By Geng Li, Yuhao Wang, Dong Li, Jianye Hao, Yuxin Peng
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