Memory is Reconstructed, Not Retrieved: Graph Memory for LLM Agents
Summary
MRAgent introduces a novel graph-based memory framework that dynamically reconstructs memory during reasoning, achieving up to 23% improvement on long-horizon benchmarks while reducing computational costs.
View Cached Full Text
Cached at: 06/15/26, 09:05 AM
Paper page - Memory is Reconstructed, Not Retrieved: Graph Memory for LLM Agents
Source: https://huggingface.co/papers/2606.06036
Abstract
MRAgent combines associative memory graphs with active reconstruction to enable dynamic memory access during reasoning, improving long-horizon memory reasoning while reducing computational costs.
Despite recent progress,LLM agentsstill struggle with reasoning over long interaction histories. While currentmemory-augmented agentsrely on a staticretrieve-then-reason paradigm, this rigid pipeline design prevents them from dynamically adapting memory access to intermediate evidence discovered during inference. To bridge this gap, we propose MRAgent, a framework that combines anassociative memory graphwith anactive reconstruction mechanism. We represent memory as aCue-Tag-Content graph, where associative tags serve assemantic bridgesconnecting fine-grained cues to memory contents. Operating on this structure, ouractive reconstruction mechanismintegrates LLM reasoning directly into memory access, allowing the agent to iteratively explore and prune retrieval paths based on accumulated evidence. This ensures that memory retrieval is dynamically adapted to the reasoning context while avoidingcombinatorial explosioncaused by unconstrained expansion. Experiments on theLoCoMo benchmarkandLongMemEval benchmarkdemonstrate significant improvements over strong baselines (up to 23%), while substantially reducing token and runtime cost, highlighting the effectiveness of active and associative reconstruction for long-horizon memory reasoning.
View arXiv pageView PDFGitHub23Add to collection
Get this paper in your agent:
hf papers read 2606\.06036
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2606.06036 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2606.06036 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2606.06036 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
@neural_avb: Here's the latest paper on Graph Memory on LLM agents
A new paper introduces Graph Memory for LLM agents.
Selective Forgetting: A Graph-Based Memory Framework for Long-Term LLM Agents
This paper evaluates a graph-based memory framework for long-term LLM agents, finding that it does not outperform flat vector retrieval on recall metrics, but a selective forgetting module effectively reduces storage with minimal performance loss.
ActiveMem: Distributed Active Memory for Long-Horizon LLM Reasoning
ActiveMem introduces a distributed active memory system that decouples agent memory from the core LLM reasoning process, achieving state-of-the-art accuracy on long-horizon tasks with significantly reduced overhead.
REAL: A Reasoning-Enhanced Graph Framework for Long-Term Memory Management of LLMs
REAL is a reasoning-enhanced graph framework for long-term memory management of LLMs that uses temporal and confidence-aware directed property graphs with non-destructive temporal updates and hybrid beam search retrieval, achieving an average improvement of 22.72%.
@dair_ai: Good work on improving memory for long-horizon agents. They separate two things that agent memory papers usually collap…
The paper introduces RSM-full, an online clustered-memory pipeline for LLM agents that separates memory merge and retrieval assembly, achieving 83% of full-context quality at 32% of token cost under tight prompt budgets.