Skip to content

PGMem: Tightly Coupled Persona-Memory Graph for Lifelong Personalized Agents

Aug 2026 · 1 citation · ⚡ 1 influential · 33 references
Computer Science

TL;DR

PGMem is a heterogeneous persona-memory graph that connects event and persona nodes through typed provenance and evidence edges, keeping each persona signal traceable to the events that support or revise it.

Abstract

Long-term personalized dialogue agents must track user preferences as their personas evolve. Existing memory systems organize past events well, but store personas as flat profiles detached from the events that justify them. This loose coupling leads to the memory-persona validity gap and the persona-aware retrieval gap. We propose PGMem, a heterogeneous persona-memory graph that connects event and persona nodes through typed provenance and evidence edges, keeping each persona signal traceable to the events that support or revise it. At retrieval time, PGMem expands from query-relevant seeds and ranks signals by evidential validity. Across three benchmarks with small language model backbones, PGMem consistently outperforms summary-based, persona-aware, graph-structured, and agentic memory baselines, and improves performance as the context grows. The source code of PGMem is available at https://github.com/wonjunchoi23/pgmem/

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Stashbird: Efficient Speaker-Indexed Memory for Conversational Agents

Stashbird is presented, an agent memory system that links source episodes to derived memory state through explicit provenance and achieves higher accuracy than Hindsight on LongMemEval-S and GroupMemBench and comparable accuracy on EverMemBench.

Chidera Biringa, Lucas Yannul, Xiao-Wen Wang et al. · 0 citations
Preprint Aug 2026

QUMem: Personalized Memory for Query-Conditioned User-State Inference in LLM Agents

A structured memory framework for query-conditioned user-state inference for long-term personalization that achieves state-of-the-art performance on both PersonaMem and KnowU-Bench, demonstrating the effectiveness of query-conditioned user-state inference for long-term personalization.

Heng Wang, Yifei Li, Lingling Zhang et al. · 0 citations
#artificial intelligence Preprint Oct 2026

DyadMem: A Long-Term Memory Benchmark of How Agents Work with Users

Long-term agents must remember not only what is true about a user, but also how a particular agent should work with that user as their shared history evolves. Existing benchmarks primarily supervise user facts and preferences or experience reusable across users, leaving this relationship-specific agent memory implicit....

Yi-Fei Tao, Xin-Yue Zhong, Henry Hengyuan Zhao et al. · 0 citations
#natural language process... Preprint Oct 2026

Event-Centric Memory with Query-Aware Graph Augmentation for Long-Term Conversational Agents

For persistent and personalized conversational agents, memory systems can enable them to remember, update, and reason over long histories by storing past interactions and retrieving relevant information. Existing memory systems typically follow two paradigms: flat-structured memory and graph-based memory. The former is...

Yi-Chen Liu, Chun-Feng Yuan, Hao-Wei Liu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

EnSIMem: Entity-Structured Indexing for Long-Term Agent Memory

Results show that entity-structured indexing and episode-level provenance provide a reliable foundation for long-term memory in agents, and EnSIMem achieves high answer accuracy while maintaining compact, evidence-focused contexts.

Xuan-Yu Meng, Xing Fan, Xin-Yi Fan et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.