SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory

• URL: http://arxiv.org/abs/2605.12061v1
• Date: Tue, 12 May 2026 12:47:43 GMT
• Title: SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory
• Abstract summary: We introduce SAGE, a Self-evolving Agentic Graph-memory Engine that models graph memory as a dynamic long-term memory substrate.<n> SAGE couples two roles: a memory writer that incrementally constucts structured graph memory from interaction histories, and a Graph Foundation Model-based memory reader to perform retrieval and provide feedback to the memory writer.
• Score: 40.68349164818526
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Long-term memory is becoming a central bottleneck for language agents. Exsting RAG and GraphRAG systems largely treat memory graphs as static retrieval middleware, which limits their ability to recover complete evidence chains from partial cues, exploit reusable graph-structrual roles, and improve the memory itself through downstream feedback. We introduce SAGE, a Self-evolving Agentic Graph-memory Engine that models graph memory as a dynamic long-term memory substrate. SAGE couples two roles: a memory writer that incrementally constucts structured graph memory from interaction histories, and a Graph Foundation Model-based memory reader to perform retrieval and provide feedback to the memory writer. We provide rigorooous theoretical annalyses supporting the framework. Across multi-hop QA, open-domain retireval, domain-specific review QA, and long-term agent-memory benchmarks, SAGE improves evidence recovery, answer grounding, and retrieval efficiency: after two self-evolution rounds, it achieves the best average rank on multi-hop QA; in zero-shot open-domain transfer, it reaches 82.5/91.6 Recall@2/5 on NQ. Further results on LongMemEval and HaluMem show that traning and reader-writer feedback improve multiple long-term memory and hallucination-diagnostic metrics, suggesting that self-evolving, structure-aware graph memory is a promising foundation for robust long-horizon language agents.

Related papers

• Retrieval-Driven Memory Reconsolidation for Long-Term LLM Agents [39.55670043123564]
  Existing memory systems update memory when new information arrives.<n>Retrieval feedback is rarely exploited to reorganize memory for future access continuously.<n>We propose textbfREALM, a framework for continually evolving long-term memory in LLM agents.
  arXiv  Detail & Related papers  (2026-09-13T05:17:37Z)
• Hierarchical Graph Memory for LLM Agents with Path-level Localization and Rewrite [12.046084242297423]
  We propose HiGram, an evolving hierarchical graph memory framework with path-level localization and rewriting.<n>Specifically, we first propose a hierarchical graph memory, which organizes the memory into coarse-to-fine architecture composed of upper-level nodes and MemoryUnits.<n>We further propose MicroGraph-based path-level localization, which leverages query and update conditioned MicroGraphs to identify support subgraph and evidence path before rewrite.
  arXiv  Detail & Related papers  (2026-08-05T17:32:43Z)
• EvoGraph-Mem: Failure-Aware Editable Graph Memory for Long-Term Language Agents [4.265255679736993]
  Existing memory-augmented agents mainly focus on storing and retrieving past experience.<n>Previously distilled insights can become outdated, over-generalized, or harmful under new task contexts.<n>We propose a failure-aware memory maintenance framework based on an editable insight graph.
  arXiv  Detail & Related papers  (2026-08-03T12:35:44Z)
• Memory is Reconstructed, Not Retrieved: Graph Memory for LLM Agents [51.30250860677378]
  We propose MRAgent, a framework that combines an associative memory graph with an active reconstruction mechanism.<n>Running on a Cue-Tag-Content graph, our active reconstruction mechanism integrates reasoning directly into memory access.<n>Experiments on the LoCoMo benchmark and LongMemEval benchmark demonstrate significant improvements over strong baselines.
  arXiv  Detail & Related papers  (2026-06-04T11:29:46Z)
• MemGym: a Long-Horizon Memory Environment for LLM Agents [69.79226770543049]
  We present MemGym, a benchmark for agentic memory that unifies existing agent gyms and in-house memory-grounded pipelines.<n>MemGym reports memory-isolated scores that decouple memory performance from reasoning, retrieval, and tool-use ability.<n>Our synthetic pipelines for MEMGYM-CODEQA and MEMGYM-DR are length-controllable, ablation-verified at every stage, and tightly aligned with downstream scenarios.
  arXiv  Detail & Related papers  (2026-05-20T07:25:33Z)
• Mem-W: Latent Memory-Native GUI Agents [50.87647372904382]
  We introduce Mem-W, a series of latent-memory-native GUI agents that treat memory as part of the agent's continuous context.<n>Across four web and mobile navigation benchmarks, Mem-W consistently improves diverse backbones and memory-enhanced baselines.
  arXiv  Detail & Related papers  (2026-05-10T04:31:23Z)
• MemORAI: Memory Organization and Retrieval via Adaptive Graph Intelligence for LLM Conversational Agents [14.16693343382686]
  Large Language Models (LLMs) lack persistent memory for long-term personalized conversations.<n>Existing graph-based memory systems suffer from information dilution, absent provenance tracking, and uniform retrieval that ignores query context.<n>We introduce MemORAI, a framework that integrates three innovations: selective memory filtering with dual-layer compression to retain user-persona-relevant content, a provenance-enriched multi-relational graph tracking factual origins at the turn level, and query-adaptive subgraph retrieval with Dynamic weighted PageRank.
  arXiv  Detail & Related papers  (2026-05-02T11:20:34Z)
• MemSearch-o1: Empowering Large Language Models with Reasoning-Aligned Memory Growth in Agentic Search [59.98962867649009]
  We propose MemSearch-o1, an agentic search framework built on reasoning-aligned memory growth and retracing.<n>MemSearch-o1 grows fine-grained memory fragments from memory seed tokens from queries, then retraces and deeply refines the memory via a contribution function, and finally reorganizes a globally connected memory path.
  arXiv  Detail & Related papers  (2026-04-19T05:35:06Z)
• MemMA: Coordinating the Memory Cycle through Multi-Agent Reasoning and In-Situ Self-Evolution [52.29303869050117]
  Memory-augmented LLM agents maintain external memory banks to support long-horizon interaction.<n>MemMA is a plug-and-play multi-agent framework that coordinates the memory cycle along both the forward and backward paths.
  arXiv  Detail & Related papers  (2026-03-19T10:15:59Z)
• Graph-based Agent Memory: Taxonomy, Techniques, and Applications [63.70340159016138]
  Memory emerges as the core module in the Large Language Model (LLM)-based agents for long-horizon complex tasks.<n>Among diverse paradigms, graph stands out as a powerful structure for agent memory due to the intrinsic capabilities to model relational dependencies.<n>This survey presents a comprehensive review of agent memory from the graph-based perspective.
  arXiv  Detail & Related papers  (2026-02-05T13:49:05Z)
• Aeon: High-Performance Neuro-Symbolic Memory Management for Long-Horizon LLM Agents [0.0]
  Large Language Models (LLMs) are constrained by the quadratic computational cost of self-attention and the "Lost in the Middle" phenomenon.<n>We propose Aeon, a Neuro-Symbolic Cognitive Operating System that redefines memory not as a static store, but as a managed OS resource.
  arXiv  Detail & Related papers  (2026-01-14T15:23:22Z)
• Implicit Graph, Explicit Retrieval: Towards Efficient and Interpretable Long-horizon Memory for Large Language Models [26.694294747866834]
  We propose LatentGraphMem, a memory framework that combines implicit graph memory with explicit subgraph retrieval.<n>LatentGraphMem stores a graph-structured memory in latent space for stability and efficiency.<n> Experiments on long-horizon benchmarks across multiple model scales show that LatentGraphMem consistently outperforms representative explicit-graph and latent-memory baselines.
  arXiv  Detail & Related papers  (2026-01-06T21:10:10Z)
• Agentic Memory: Learning Unified Long-Term and Short-Term Memory Management for Large Language Model Agents [57.38404718635204]
  Large language model (LLM) agents face fundamental limitations in long-horizon reasoning due to finite context windows.<n>Existing methods typically handle long-term memory (LTM) and short-term memory (STM) as separate components.<n>We propose Agentic Memory (AgeMem), a unified framework that integrates LTM and STM management directly into the agent's policy.
  arXiv  Detail & Related papers  (2026-01-05T08:24:16Z)
• LiCoMemory: Lightweight and Cognitive Agentic Memory for Efficient Long-Term Reasoning [15.189701702660821]
  LiCoMemory is an end-to-end agentic memory framework for real-time updating and retrieval.<n>CoGraph is a lightweight hierarchical graph that utilizes entities and relations as semantic indexing layers.<n>Experiments on long-term dialogue benchmarks, LoCoMo and LongMemEval, show that LiCoMemory not only outperforms established baselines in temporal reasoning, multi-session consistency, and retrieval efficiency, but also notably reduces update latency.
  arXiv  Detail & Related papers  (2025-11-03T11:02:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.