Profile-Graph Memory for LLM Agents: Implicit Cross-Entity Traversal through Narrative Profiles

• URL: http://arxiv.org/abs/2607.19359v1
• Date: Mon, 01 Jun 2026 09:48:16 GMT
• Title: Profile-Graph Memory for LLM Agents: Implicit Cross-Entity Traversal through Narrative Profiles
• Abstract summary: We introduce MemHop, a multi-hop memory benchmark of 1,000 questions at hop depths 1-5 across 10 social-network scenarios.<n>Second, we present Profile-Graph Memory (ProGraph), a two-layer memory architecture combining (i) profile expansion.<n>Third, a full-grid ablation shows cross-benchmark mechanism: profile expansion drives multi-hop reasoning.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Long-term memory is essential for LLM agents that interact across sessions, yet current memory benchmarks primarily evaluate single-hop recall, leaving multi-hop association largely unmeasured. We make three contributions. First, we introduce MemHop, a multi-hop memory benchmark of 1,000 questions at hop depths 1-5 across 10 social-network scenarios, with per-hop evidence annotations. Second, we present Profile-Graph Memory (ProGraph), a two-layer memory architecture combining (i) profile expansion -- substring-matched traversal of entity names that naturally appear in LLM-written profile narratives, a minimal alternative to explicit knowledge-graph construction -- and (ii) compression residuals -- exact dates, quantities, and named items co-extracted with each profile update at zero extra API cost. Third, a full-grid ablation shows cross-benchmark mechanism specialization: profile expansion drives multi-hop reasoning (-22.6pp on MemHop when removed) while compression residuals drive precision recall (-8.6pp on LoCoMo when not co-extracted), with cross-effects under 3pp within a single architecture. ProGraph averages 80.1% on MemHop (matching the FullContext reference) and 78.4% on LoCoMo (exceeding FullContext by 11.3pp), outperforming Mem0, A-Mem, HippoRAG, and RAG on both. We release MemHop, ProGraph, and baseline implementations.

Related papers

• MemForest: Efficient Agent Memory Management via EventTree Partitioning and Progressive Merging [23.836080891576135]
  We propose textbfMemForest, a general memory compression framework for agent memory systems.<n>MemForest partitions historical memory into event-centric units by leveraging global semantic similarity and local temporal continuity.<n>Under the multimodal M3-Agent framework, it preserves textbf99.7% of the original performance with a textbf50% compression ratio.
  arXiv  Detail & Related papers  (2026-09-08T05:30:30Z)
• Zero-Mem: Zero-Token Memory Operations for LLM Agents [17.228305588778]
  Zero-Mem preserves original interaction traces as its source of record.<n>Zero-Mem achieves competitive performance across long-memory and long-context question-answering benchmarks.
  arXiv  Detail & Related papers  (2026-07-31T13:01:06Z)
• Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents [72.3752981234916]
  Large Language Model (LLM) agents increasingly rely on external memory systems to accumulate experience across tasks.<n>We present Memory as a Controlled Process (MemCon), a framework that models memory operations as a Markov Decision Process.<n>MemCon consistently outperforms multiple memory baselines by up to 15.2 points in task success while reducing token consumption by 5-20%.
  arXiv  Detail & Related papers  (2026-07-15T08:32:40Z)
• Homer: Understanding Long-form Videos with Hierarchical Memory and Agentic Reasoning [77.7531245219403]
  textscHomer is a Hierarchical Online Memory Exploration and Reasoning framework.<n>textscHomer's memory mirrors the multi-scale structure of long videos, ranging from raw perception, to recurring entities, to events connected by explicit temporal and causal relations.<n>textscHomer outperforms the previous best agent method by $+5.5$, $+10.8$, and $+4.4$ points on M3-Bench-robot, M3-Bench-web, and Video-MME-Long.
  arXiv  Detail & Related papers  (2026-07-01T05:53:09Z)
• AdaMem: Learning What to Remember for Personalized Long-Horizon LLM Agents [79.03892269184145]
  We argue that what is worth remembering is role-dependent, and propose textbfAdaMem (Adaptive Memory)<n>AdaMem improves QA accuracy by up to textbf+9.0% over the uniform Mem0 baseline while shrinking memory volume by textbf9%.
  arXiv  Detail & Related papers  (2026-06-19T06:35:52Z)
• 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)
• MemQ: Integrating Q-Learning into Self-Evolving Memory Agents over Provenance DAGs [47.66730296440261]
  We introduce MemQ, which propagates credit backward through a provenance DAG that records which memories were retrieved when each new memory was created.<n>Across six benchmarks, MemQ achieves the highest success rate on all six in generalization evaluation and runtime learning.<n>We further study how $$ and $$ interact with the EC-MDP structure, providing principled guidance for parameter selection and future research.
  arXiv  Detail & Related papers  (2026-05-08T18:30:24Z)
• Drawing on Memory: Dual-Trace Encoding Improves Cross-Session Recall in LLM Agents [0.22917707112773592]
  LLM agents with persistent memory store information as flat factual records provide little context for temporal reasoning, change tracking, or cross-session aggregation.<n>Inspired by the drawing effect, we introduce dual-trace memory encoding.<n>In this method, each stored fact is paired with a concrete scene trace, a narrative reconstruction of the moment and context in which the information was learned.
  arXiv  Detail & Related papers  (2026-04-14T16:45:06Z)
• GAAMA: Graph Augmented Associative Memory for Agents [0.0]
  GAAMA is a graph-augmented associative memory system that constructs a concept-mediated hierarchical knowledge graph.<n>On the LoCoMo-10 benchmark (1,540 questions across 10 multi-session conversations), GAAMA achieves 78.9% mean reward, outperforming a tuned RAG baseline.
  arXiv  Detail & Related papers  (2026-03-29T23:33:38Z)
• MemX: A Local-First Long-Term Memory System for AI Assistants [0.0]
  We present MemX, a local-first long-term memory system for AI with stability-oriented retrieval design.<n>MemX is implemented in Rust on top of lib and an OpenAI-compatible embedding API, providing persistent, searchable, and explainable memory for conversational agents.
  arXiv  Detail & Related papers  (2026-03-17T06:39:54Z)
• MemSearcher: Training LLMs to Reason, Search and Manage Memory via End-to-End Reinforcement Learning [73.27233666920618]
  We propose MemSearcher, an agent workflow that iteratively maintains a compact memory and combines the current turn with it.<n>At each turn, MemSearcher fuses the user's question with the memory to generate reasoning traces, perform search actions, and update memory to retain only information essential for solving the task.<n>We introduce multi-context GRPO, an end-to-end RL framework that jointly optimize reasoning, search strategies, and memory management of MemSearcher Agents.
  arXiv  Detail & Related papers  (2025-11-04T18:27:39Z)
• Mem0: Building Production-Ready AI Agents with Scalable Long-Term Memory [0.5584627289325719]
  Large Language Models (LLMs) have demonstrated remarkable prowess in generating contextually coherent responses.<n>But their fixed context windows pose fundamental challenges for maintaining consistency over prolonged multi-session dialogues.<n>We introduce Mem0, a scalable memory-centric architecture that addresses this issue by dynamically extracting, consolidating, and retrieving salient information from ongoing conversations.
  arXiv  Detail & Related papers  (2025-04-28T01:46:35Z)

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.