arXiv:2601. 21714v5 Announce Type: replace Abstract: The evolution of Large Language Model (LLM) agents towards System~2 reasoning, characterized by deliberative, high-precision problem-solving, requires maintaining rigorous logical integrity over extended horizons.
By Kaixiang Wang, Yidan Lin, Jiong Lou, Zhaojiacheng Zhou, Bunyod Suvonov, Jie Li
arXiv:2608. 05095v1 Announce Type: new Abstract: Agents for long term reasoning require a memory that can be efficiently and effectively updated over time, as new facts and external feedback continue to arrive.
By Xiawei Yue, Boran Wang, Xiaoqing Zhang, Shuxin Zheng, Ziwei Zhang
arXiv:2603. 00026v2 Announce Type: replace-cross Abstract: Memory management is essential for LLM agents in long-term interactions.
By Xiaohui Zhang, Zequn Sun, Chengyuan Yang, Yaqin Jin, Yazhong Zhang, Wei Hu
Agents for long term reasoning require a memory that can be efficiently and effectively updated over time, as new facts and external feedback continue to arrive. Recently, graph memory has been adopted to offer structural organization for multi-hop retrieval and reasoning.
arXiv:2602. 03315v2 Announce Type: replace Abstract: Agent memory systems must accommodate continuously growing information while supporting efficient, context-aware retrieval for downstream tasks.
By Menglin Xia, Xuchao Zhang, Shantanu Dixit, Paramaguru Harimurugan, Rujia Wang, Victor Ruhle, Robert Sim, Chetan Bansal, Saravan Rajmohan
arXiv:2606. 28349v1 Announce Type: cross Abstract: Long-context reasoning requires models to access, retrieve, and integrate evidence scattered across documents, dialogues, and accumulated interaction histories.
By Zeju Li, Ziyang Zheng, Yizhou Zhou, Qiang Xu
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.
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
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:2609.14066v1 Announce Type: cross
Abstract: Although existing multi-agent Retrieval-Augmented Generation (RAG) systems have demonstrated promise on complex multimodal reasoning tasks, they rema...
By Zhongyu Wang
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:2607. 22562v1 Announce Type: new Abstract: Managing long-context dependencies remains a primary bottleneck in LLM agents, as redundant and irrelevant information can degrade multi-step reasoning.
By Ning Yang, Siqi Li, Miaoxin Shen, Yuan Zhou, Meng Zhang, Tong Li, Haijun Zhang