Hugging Face Trending Papers

Graph-Based Personalized Memory for LLM Agents: Representation, Evolution, Retrieval, and Evaluation

arXiv Computation and Language
3d ago

AtomMem: Building Simple and Effective Memory System for LLM Agents via Atomic Facts

AtomMem is a long‑term memory system for large language models that stores high‑value atomic facts extracted from long‑form interactions. It organizes these facts into hierarchical event structures and temporal profiles, enabling coherent episodic context and dynamic tracking of user attributes. During retrieval, an associative memory graph connects fragmented memories, and experiments on the LoCoMo benchmark show state‑of‑the‑art performance across reasoning tasks.

By Yanyu Yao, Shangze Li, Zhi Zheng, Hui Zheng, Qi Liu, Tong Xu, Enhong Chen
arXiv AI
Sep 10

EdgeMem: LLM-Free Agent Memory Construction and Retrieval via Evidence-Preserving Multi-Anchor Hypergraph

EdgeMem is a new agent-memory method that preserves original interaction turns and organizes them using complementary content, temporal, and episodic cues via a multi‑anchor hypergraph. It performs lightweight local processing, returning source evidence directly and reserving LLM use only for final answer generation. Experiments on LoCoMo and LongMemEval‑S demonstrate strong retrieval and memory‑grounded question answering, with EdgeMem achieving the highest strict‑judge score among seven systems on LoCoMo while requiring no generative‑LLM calls for construction and retrieval.

By Zeyang Cui, Jiannong Cao, Zhiyuan Wen, Bo Yuan, Junlan Feng, Shengyuan Chen
arXiv AI
Oct 5

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

DyadMem introduces a new benchmark for evaluating how long‑term agents remember user‑specific relational information, called User‑conditioned Relational Agent Memory (URAM). The dataset contains 3,065 episodes, 50,961 sessions, and 61,210 QA pairs, with detailed annotations for memory capture, update, and recall across multi‑session trajectories. Experiments on 20 models show strong performance in a gold‑memory setting but a significant drop in full‑pipeline QA, highlighting gaps in current LLM memory capabilities.

By Yifei Tao, Xinyu Zhong, Henry Hengyuan Zhao, Fanyi Wang, Tengda Guo, Wentao Qiu, Ying Wang, Liujian Tang
arXiv Computation and Language
Sep 3

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

PGMem introduces a persona‑memory graph that tightly couples user persona signals with the events that support or revise them, using typed provenance and evidence edges. This design addresses gaps in existing memory systems where personas are stored as flat, detached profiles. Experiments on three benchmarks show that PGMem outperforms various baseline memory approaches, especially as dialogue context length increases.

By Wonjun Choi, Yerim Kim, Yukyung Lee, Susik Yoon
arXiv AI
Jun 9

MemToolAgent overview with a simple restaurant booking scenario where the agent retrieves similar memories, receives feedback on an invalid time format, and generates a reflection to update its memory

arXiv:2606. 07909v1 Announce Type: new Abstract: Modern large language model (LLM) agents can use external tools to help users solve complex tasks.

By Suleyman Armagan Er, Danilo Ribeiro, Yogesh Virkar, Surafel Lakew, Adi Kalyanpur, James Gung, Thomas Delteil, Arshit Gupta
arXiv AI
Oct 27

Agent Memory as Recommendation: Recommender-System Design for Long-Term Memory of LLM Agents

The paper proposes treating an LLM agent’s long‑term memory selection as a budgeted slate recommendation problem, framing each request as a user, stored memories as items, and the context window as a slate. By applying recommender‑system techniques—candidate generation, learning‑to‑rank, and slate construction—AgentMemRec selects relevant memories without any LLM calls. Experiments on LongMemEval and LoCoMo show that AgentMemRec outperforms existing memory and context‑selection methods by 10–31 accuracy points and achieves comparable or better performance than an LLM reranker while reducing serving cost and eliminating LLM calls at write time.

By Xinyu Zhang, Weiwei Sun