通过记忆结构引导反思式检索,提升长对话中记忆的准确性和效率。
MGRetrieval: Memory-Guided Reflective Retrieval for Long-Term Dialogue Agents

- 基于历史记忆语义结构构建精准检索路径,避免盲目搜索。
- 在LoCoMo数据集上,相比最强基线提升8.91% F1和11.11% BLEU-1。
- 适合需要长期记忆维护的对话系统研发者使用。
大语言模型在对话任务中取得显著进展,但冗余的记忆上下文严重限制了其在长时对话代理中的表现。外部记忆系统被提出以改善记忆维持,然而这些系统主要依赖单次检索,难以获取充分且相关的证据。尽管近期方法引入反思机制,但其检索路径由大模型基于有限证据生成,导致检索不稳定并增加延迟开销。为解决上述问题,我们提出MGRetrieval,一种将反思式检索建立在历史记忆语义结构上的策略。具体包括两步:(1) 参考历史记忆结构构建更精确的检索路径;(2) 大模型保留关键记忆,并判断累积记忆是否足够终止迭代检索。该方法使检索过程遵循语义连贯路径。通过记忆引导检索与关键记忆传播,MGRetrieval逐步构建简洁且充分的记忆上下文。在LoCoMo数据集上的大量实验表明,MGRetrieval在Qwen2.5-14B和Qwen3-14B上平均提升8.91% F1和11.11% BLEU-1,同时保持可接受的令牌与延迟成本。
原文摘要 · Abstract (English)
Large Language Models (LLMs) have made significant progress in dialogue, yet redundant memory contexts severely limit their effectiveness in long-term dialogue agents. External memory systems have been proposed to improve memory maintenance. However, these systems mainly rely on one-shot retrieval, which limits their ability to retrieve sufficient and relevant evidence. Although recent methods introduce reflection into retrieval, their retrieval paths are generated by the LLM from limited evidence, leading to unstable retrieval and additional latency overhead. %These limitations highlight the need for effective retrieval mechanisms. To address these limitations, we propose MGRetrieval, a retrieval strategy that grounds reflective retrieval in the semantic structure of historical memories. Specifically, MGRetrieval consists of two steps: (1) It references the structure of historical memories to construct a more precise retrieval path. (2) The LLM retains critical memories and determines whether accumulated memories are sufficient to stop further iterative retrieval. This allows the retrieval process to follow semantically meaningful paths. Through memory-guided retrieval and critical memory propagation, MGRetrieval gradually constructs concise and sufficient memory contexts. Extensive experiments on LoCoMo show that MGRetrieval outperforms the strongest baseline by 8.91\% in F1 and 11.11\% in BLEU-1 on average across Qwen2.5-14B and Qwen3-14B, while maintaining practical token and latency costs. The code can be found in https://anonymous.4open.science/r/MGRetrieval.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。