让大模型记忆能像人一样联想,自动补全分散的过往信息。
RippleMem: From Isolated Retrieval to Associative Recollection for Long-Term Agent Memory

- 用事件为中心的图结构存储记忆,支持按线索逐步扩展回忆。
- 在长时任务评估中,准确率提升最高达11.87%,构建成本降低30倍。
- 适合需要长期推理的智能体,如对话系统、复杂决策助手。
基于大语言模型的智能体越来越依赖外部记忆来支撑长周期推理与交互。然而,瓶颈不在于存储经验,而在于当相关信息分散于多次交互中时,如何准确召回。现有方法要么需搜索冗长上下文,要么返回孤立片段,或因构建成本高而难以实用。本文提出RippleMem,一种将一次性检索改为自适应关联回忆的记忆系统。它将交互历史作为富含线索的事件记忆单元,组织成以事件为中心的记忆图。给定查询时,先通过混合线索召回相关记忆锚点,再沿语义和结构关联扩展,补全缺失证据。初始召回不仅提供答案上下文,还成为进一步补全的线索。在LoCoMo和LongMemEval-S上的实验表明,RippleMem在所有测试场景中表现最佳,在LoCoMo上使LLM-as-a-Judge准确率提升3.95%,在LongMemEval-S上最高提升11.87%,同时图构建成本降低约30倍。
原文摘要 · Abstract (English)
LLM-based agents increasingly rely on external memory to support long-horizon reasoning and interaction. However, the main bottleneck is not simply storing past experience, but recovering the right set of evidence when relevant information is distributed across many interactions. Existing approaches struggle with this access problem. Full-context methods require noisy long-context search, flat retrieval often returns isolated and incomplete records, and graph-based memory systems can be expensive to construct while compressing rich event context. We introduce RippleMem, a long-term memory system that replaces one-shot retrieval with adaptive associative recollection. Inspired by cue-dependent episodic retrieval and associative completion, RippleMem stores interaction history as cue-rich episodic memory units and organizes them in an event-centric memory graph. Given a query, it first recalls relevant memory anchors through hybrid cues, then expands from these anchors along semantic and structural associations to recover missing supporting evidence. In this way, initially recalled memories serve not only as answer context, but also as cues for completing the evidence needed to answer. Experiments on LoCoMo and LongMemEval-S show that RippleMem achieves the best overall performance across evaluated settings, improving LLM-as-a-Judge accuracy by 3.95% on LoCoMo and up to 11.87% on LongMemEval-S, while reducing graph construction cost by about 30x.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。