REAL: A Reasoning-Enhanced Graph Framework for Long-Term Memory Management of LLMs

• URL: http://arxiv.org/abs/2606.10694v1
• Date: Tue, 09 Jun 2026 10:53:10 GMT
• Title: REAL: A Reasoning-Enhanced Graph Framework for Long-Term Memory Management of LLMs
• Abstract summary: 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.
• Score: 17.526686616588794
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Large Language Models (LLMs) are increasingly expected to interact with users over long time horizons. However, due to their finite context window, LLMs cannot retain all past interactions, making long-term memory management essential for storing, updating, and retrieving historical information beyond the context limit. Although recent memory systems attempt to address this issue by storing historical information externally, existing approaches suffer from three key limitations: flat text-based memory organizations fail to capture explicit relations among memories, structured memory systems often destructively overwrite evolving facts, and current retrieval mechanisms remain query-agnostic and passive when evidence is incomplete. REAL constructs long-term conversational memory as a temporal and confidence-aware directed property graph, where each atomic fact is represented with entities, relations, valid-time intervals, confidence scores, and exploration intent labels. During memory construction, REAL adopts a non-destructive temporal update strategy that preserves parallel fact versions and their validity intervals, enabling faithful tracking of fact evolution. During retrieval, REAL anchors query-relevant root entities, decouples their exploration intents, and performs semantic evaluator-guided hybrid beam search to extract compact memory subgraphs. It further incorporates counterfactual inference to repair unreliable retrieval states and recover missing memory evidence through implicit logical relations. Comprehensive experiments demonstrate that REAL substantially improves long-term memory performance over flat-text, graph-based, and existing memory baselines, achieving an average improvement of 22.72\%.

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)
• Beyond Retrieval: Progressive Latent Memory Evolution for Streaming Video Understanding [64.34948094316685]
  We introduce LatentStream, a progressive latent working memory framework that shifts streaming memory from store-and-retrieve to retrieve-and-internalize.<n>LatentStream achieves new state-of-the-art results on existing online and offline video benchmarks.
  arXiv  Detail & Related papers  (2026-09-03T17:28:14Z)
• MemoryLACE: Memory Lifecycle-Aware Consolidation and Evidence Retrieval [25.208594041928354]
  We introduce MemoryLACE, a lightweight memory framework that explicitly models the lifecycle of textual evidence.<n>MemLACE reconstructs relation-aware evidence units that expose current, historical, supporting, and conflicting evidence for downstream reasoning.<n>Across BEAM and StructMemEval, using open-weight and proprietary LLM backbones, MemLACE achieves the highest overall performance in same-backbone comparisons.
  arXiv  Detail & Related papers  (2026-09-02T22:33:51Z)
• MemOps: Benchmarking Lifecycle Memory Operations in Long-Horizon Conversations [50.24315431387575]
  We introduce MemOps, a benchmark that reformulates conversational memory as a sequence of lifecycle operations.<n>MemOps represents each memory event with a structured trace specifying its trigger, target, scope, state transition, and supporting evidence.<n>Across long-context, retrieval-based, parametric and managed-memory systems, MemOps disentangles failure modes that final-answer accuracy alone conceals.
  arXiv  Detail & Related papers  (2026-07-14T15:33:44Z)
• MemRefine: LLM-Guided Compression for Long-Term Agent Memory [67.62350557461352]
  Large language model (LLM) agents are increasingly expected to operate over long-term interactions.<n>As interactions accumulate, the memory store grows without bound and fills with redundant entries that inflate storage cost and degrade retrieval by crowding out the most useful evidence.<n>This is especially limiting on resource-constrained platforms with hard memory budgets.<n>We propose storage-budgeted memory management, the task of keeping an already constructed memory store within a fixed budget while preserving information useful for future interactions.
  arXiv  Detail & Related papers  (2026-06-11T10:46:17Z)
• Infini Memory: Maintainable Topic Documents for Long-Term LLM Agent Memory [19.802226925602927]
  Long-term LLM agents need persistent memory that can track changing facts and provide relevant evidence across sessions.<n>We propose Infini Memory, a maintainable text-based persistent memory architecture that treats agent memory as topic-structured documents.
  arXiv  Detail & Related papers  (2026-06-09T10:31:51Z)
• 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)
• MemGuard: Preventing Memory Contamination in Long-Term Memory-Augmented Large Language Models [56.31411457917676]
  We introduce MemGuard, a type-aware memory framework that preserves functional memory boundaries during memory construction and retrieval.<n>Across hallucination and long-horizon conversation benchmarks, MemGuard improves memory reliability by up to 28.27% while retrieving up to 5.8x fewer memory tokens than prior methods.
  arXiv  Detail & Related papers  (2026-05-27T06:04:19Z)
• MemGround: Long-Term Memory Evaluation Kit for Large Language Models in Gamified Scenarios [33.8882826707344]
  MemGround is a rigorous long-term memory benchmark grounded in rich, gamified interactive scenarios.<n>To comprehensively quantify both memory utilization and behavioral trajectories, we propose a multi-dimensional metric suite.
  arXiv  Detail & Related papers  (2026-03-23T02:57:39Z)
• All-Mem: Agentic Lifelong Memory via Dynamic Topology Evolution [20.68235182577703]
  All-Mem maintains a structured memory bank via explicit, non destructive consolidation.<n>Periodically offline, an LLM diagnoser proposes confidence scored topology edits executed with three operators: SPLIT, MERGE, and UPDATE.<n>At query time, typed links enable hop bounded, budgeted expansion from active anchors to archived evidence when needed.
  arXiv  Detail & Related papers  (2026-03-20T03:14:40Z)
• 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)
• Continuum Memory Architectures for Long-Horizon LLM Agents [0.0]
  Retrieval-augmented generation (RAG) has become the default strategy for providing large language model (LLM) agents with contextual knowledge.<n>We define the textitContinuum Memory Architecture (CMA), a class of systems that maintain and update internal state across interactions.<n>We show consistent behavioral advantages on tasks that expose RAG's structural inability to accumulate, mutate, or disambiguate memory.
  arXiv  Detail & Related papers  (2026-01-14T22:40:35Z)
• Beyond Dialogue Time: Temporal Semantic Memory for Personalized LLM Agents [68.84161689205779]
  Temporal Semantic Memory (TSM) is a memory framework that models semantic time for point-wise memory.<n>TSM consistently outperforms existing methods and achieves up to 12.2% absolute improvement in accuracy.
  arXiv  Detail & Related papers  (2026-01-12T12:24:44Z)
• Evo-Memory: Benchmarking LLM Agent Test-time Learning with Self-Evolving Memory [89.65731902036669]
  Evo-Memory is a streaming benchmark and framework for evaluating self-evolving memory in large language model (LLM) agents.<n>We evaluate over ten representative memory modules and evaluate them across 10 diverse multi-turn goal-oriented and single-turn reasoning and QA datasets.
  arXiv  Detail & Related papers  (2025-11-25T21:08: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)

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.