arXiv Computation and Language

Twists and Turns: A Graph-Based Benchmark and Framework for Long-Term Memory in Exploration Tasks

The paper introduces “LExMem”, a graph‑guided benchmark that evaluates long‑term memory in exploration tasks by modeling these processes as evolving graphs and generating 224 dialogues with 2,018 question‑answer pairs. It also presents “LExGraph”, a graph‑based memory framework that incrementally organizes dialogues into interconnected nodes and retrieves evidence via hybrid retrieval and neighbor expansion. Experiments show that “LExMem” challenges existing systems, while “LExGraph” outperforms them and generalizes to external benchmarks.

arXiv AI
Aug 19

G-ReAct: Graph-Guided Deep Search via Structure-State Co-Evolution

G-ReAct is a reasoning framework that frames deep search as state evolution over a fixed-topology query graph, enabling explicit tracking of search progress and constraint preservation. It generates high-quality trajectories for fine-tuning and provides structured guidance during inference without extra fine-tuning. Experiments show that with only 1.9K generated trajectories, a Qwen3 model achieves strong accuracy on BrowseComp-ZH and XBench, outperforming larger open-source baselines, and consistently improves existing LLMs on deep-search tasks.

By Shaoxiong Yang, Mengyuan Zhang, Shaojun Lin, Chao Li, Wei Liu, Kun Shao, Jian Luan
arXiv AI
Sep 10

When Does Memory Help? A Cost-Aware Evaluation of Long-Term Memory in Tool-Using LLM Agents

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 AI
Jul 16

Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents

arXiv:2607. 13591v1 Announce Type: cross Abstract: Large Language Model (LLM) agents increasingly rely on external memory systems to accumulate experience across tasks.

By Eric Hanchen Jiang, Zhi Zhang, Yuchen Wu, Levina Li, Dong Liu, Xiao Liang, Rui Sun, Yubei Li, Edward Sun, Haozheng Luo, Zhaolu Kang, Aylin Caliskan, Kai-Wei Chang, Ying Nian Wu
arXiv Computation and Language
Oct 9

Event-Centric Memory with Query-Aware Graph Augmentation for Long-Term Conversational Agents

The paper introduces QGMem, a memory framework for conversational agents that organizes dialogue history into event-indexed atomic units and consolidates related units into dynamic memory traces. When a query is posed, QGMem retrieves complementary candidate memories, reranks them to form a compact working memory, and represents this working memory as a local graph to expose relational dependencies. Experiments on six benchmarks demonstrate consistent improvements in retrieval, multi‑hop evidence composition, conflict resolution, and ultra‑long dialogue reasoning while keeping context size and inference cost moderate.

By Yichen Liu, Chunfeng Yuan, Haowei Liu, Wenjuan Li, Zefeng Lin, Bing Li, Xu Chen, Weiming Hu
arXiv AI
Oct 28

Experience Memory Graph: Extracting Reusable Correction Knowledge from Agent Trajectories

The paper introduces Experience Memory Graph (EMG), a framework that transforms agent failure recovery into a graph matching problem. By converting failed and successful trajectories into directed action decision graphs, EMG extracts common subgraphs and edit paths that reveal explicit correction strategies, storing them in a memory graph with intra‑task nodes and cross‑task edges. During testing, EMG retrieves relevant insights to guide the agent in a single attempt, improving performance on ALFWorld and ScienceWorld without extra reflection rounds.

By Wenjun Wang, Yuchen Fang, Fengrui Liu, Zibo Liang, Kai Zheng