Hierarchical Graph Memory for LLM Agents with Path-level Localization and Rewrite

• URL: http://arxiv.org/abs/2608.05095v1
• Date: Wed, 05 Aug 2026 17:32:43 GMT
• Title: Hierarchical Graph Memory for LLM Agents with Path-level Localization and Rewrite
• Abstract summary: 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.
• Score: 12.046084242297423
• License: http://creativecommons.org/licenses/by/4.0/
• 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. Recently, graph memory has been adopted to offer structural organization for multi-hop retrieval and reasoning. However, existing methods store all memories in a flat graph, and accumulated historical memories can introduce irrelevant contexts and increase the cost of evidence selection during retrieval. Moreover, they typically update memory units independently, requiring repeated unit-wise rewrite to cover related changes. To address these issues, we propose HiGram, an evolving hierarchical graph memory framework with path-level localization and rewriting. Specifically, we first propose a hierarchical graph memory, which organizes the memory into coarse-to-fine architecture composed of upper-level nodes and MemoryUnits, thereby reducing the amount of irrelevant information during retrieval. We further propose MicroGraph-based path-level localization, which leverages query and update conditioned MicroGraphs to identify support subgraph and evidence path before rewrite. Finally, we propose a coordinated rewriting method that jointly revises intra-unit memory and inter-unit dependencies, enable valid dependency structures updating in the localized evidence path. Experiments on benchmarks for long-term conversational question answering and conflict-aware memory evaluation demonstrate that our method demonstrate substantial improvements over baselines in answer quality and token efficiency. Besides, our method improves answer accuracy and query-valid evidence selection under dynamic, static, and conditional conflicts.

Related papers

• GraphMemix: Query-Aware Evidence Forests for Long-Term Multimodal Agent Memory [87.58855368314693]
  We propose GraphMemix, a graph memory framework that models memory organization as query-aware evidence-forest construction.<n> Experimental results across four long-term multimodal memory benchmarks demonstrate significant improvements with different foundation models.
  arXiv  Detail & Related papers  (2026-08-27T11:28:49Z)
• MemChain: Learning Interpretable Memory Traces for Memory-Augmented LLM Agents [26.87993979719045]
  Memory-augmented LLM agents typically answer queries by retrieving relevant memories and feeding them directly to an answer model.<n>We propose MemChain, a trainable post-retrieval memory policy that transforms retrieved candidates into answer-facing active memory.<n>We show that MemChain consistently achieves state-of-the-art performance across both closed-source and open-weight frozen answer models.
  arXiv  Detail & Related papers  (2026-07-27T07:37:43Z)
• REAL: A Reasoning-Enhanced Graph Framework for Long-Term Memory Management of LLMs [17.526686616588794]
  Large Language Models (LLMs) are increasingly expected to interact with users over long time horizons.<n>LLMs cannot retain all past interactions, making long-term memory management essential for storing, updating, and retrieving historical information.<n> REAL constructs long-term conversational memory as a temporal and confidence-aware directed property graph.
  arXiv  Detail & Related papers  (2026-06-09T10:53:10Z)
• 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)
• Learning to Retrieve: Dual-Level Long-Term Memory for Text-to-SQL Agents [63.38073530162493]
  Long-term memory helps agents reuse past experiences.<n> Static methods rely on fixed similaritys that do not optimize downstream utility.<n>We propose MERIT, a dynamic multi-horizon memory retrieval framework.
  arXiv  Detail & Related papers  (2026-05-30T05:44:34Z)
• SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory [40.68349164818526]
  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.
  arXiv  Detail & Related papers  (2026-05-12T12:47:43Z)
• 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)
• AMA: Adaptive Memory via Multi-Agent Collaboration [54.490349689939166]
  We propose Adaptive Memory via Multi-Agent Collaboration (AMA), a novel framework that leverages coordinated agents to manage memory across multiple granularities.<n>AMA significantly outperforms state-of-the-art baselines while reducing token consumption by approximately 80% compared to full-context methods.
  arXiv  Detail & Related papers  (2026-01-28T08:09:49Z)
• Memory Matters More: Event-Centric Memory as a Logic Map for Agent Searching and Reasoning [55.251697395358285]
  Large language models (LLMs) are increasingly deployed as intelligent agents that reason, plan, and interact with their environments.<n>To effectively scale to long-horizon scenarios, a key capability for such agents is a memory mechanism that can retain, organize, and retrieve past experiences.<n>We propose CompassMem, an event-centric memory framework inspired by Event Theory.
  arXiv  Detail & Related papers  (2026-01-08T08:44:07Z)
• 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)
• ArcMemo: Abstract Reasoning Composition with Lifelong LLM Memory [21.4675019810992]
  Concept-level memory is reusable, modular abstractions distilled from solution traces and stored in natural language.<n>We evaluate on ARC-AGI, a benchmark that stresses compositional generalization and abstract reasoning.<n>We find abstract concepts to be the most consistent memory design, outscoring the baseline at all tested inference compute scales.
  arXiv  Detail & Related papers  (2025-09-04T17:54:19Z)

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.