提出混合结构记忆机制,让智能体记忆随时间演化并高效检索。
H-Mem: A Novel Memory Mechanism for Evolving and Retrieving Agent Memory via a Hybrid Structure

- 构建时序语义树与知识图谱的混合结构,实现记忆渐进演化。
- 在三个基准上达到当前最佳问答性能,显著提升记忆利用率。
- 适合需要长期记忆与复杂推理的智能体系统开发者参考。
大型语言模型驱动的智能体(如 OpenClaw 和 Manus)普遍存在大量记忆数据。尽管已有研究尝试利用记忆提升问答任务表现,但缺乏对记忆随时间演变的有效建模与高效检索机制,导致记忆利用效果不佳。为此,本文提出 H-Mem,一种基于混合结构的新颖记忆机制,不仅能有效建模长周期内记忆的演化过程,还可提供高效的记忆检索能力。H-Mem 构建了时序-语义树结构,使短期记忆逐步演化为长期记忆,后者对前者进行信息摘要;同时构建知识图谱,捕捉记忆中实体间的关系。此外,通过结合树与图的混合结构,实现高效的记忆检索。在三个智能体记忆基准上的大量实验表明,H-Mem 在问答任务上达到当前最优性能。
原文摘要 · Abstract (English)
Memory data are ubiquitous in Large Language Model (LLM)-based agents (e.g., OpenClaw and Manus). A few recent works have attempted to exploit agents'memory for improving their performance on the question-answering (QA) task, but they lack a principled mechanism for effectively modeling how memory data evolves over time and retrieving memory data effectively, leading to poor performance in memory utilization. To fill this gap, we present H-Mem, a novel memory mechanism via a hybrid structure that can not only effectively model the evolution of agent memory over a long period of time, but also provide an efficient memory retrieval approach. Particularly, H-Mem builds a temporal and semantic tree structure that allows the short-term memory data to evolve progressively into long-term memory data, where the latter provides summarized information about the former, while simultaneously constructing a knowledge graph to capture the relationships between entities in memory. Moreover, it offers an effective memory retrieval approach by exploiting the hybrid structure of the tree and graph structures. Extensive experiments on three agent memory benchmarks show that H-Mem achieves state-of-the-art performance on the QA task.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。