让大模型在长对话中精准找证据,边问边提炼关键信息。
DeferMem: Query-Time Evidence Distillation via Reinforcement Learning for Long-Term Memory QA

- 查询时先广搜候选证据,再用强化学习精炼出有用内容。
- 在两个评测集上准确率最高,运行最快且不花额外调用钱。
- 适合需要长期记忆的智能助手、客服系统等场景使用。
大型语言模型代理在长时记忆问答任务中仍面临挑战,因支持答案的证据常散落在冗长对话历史中,并被大量无关内容掩盖。现有记忆系统通常在查询前处理记忆,仅基于相似性检索,导致下游回答者需从噪声中清洗并重构证据。本文提出DeferMem框架,将问题拆解为高召回候选检索与查询条件下的证据精炼两步。它采用轻量级段落链接结构组织原始历史,在查询时检索广泛候选;随后通过训练有素的内存蒸馏器,利用我们提出的DistillPO强化学习算法,将高召回但高噪声的候选转化为忠实、自包含、查询相关的证据。DistillPO将后检索阶段的证据精炼视为结构化动作,包括消息选择与证据重写,采用分解-门控奖励管道和结构对齐的优势分配,分别控制有效性到质量检查的奖励分量,并提前暴露任务级正确性反馈,将每项奖励分配给对应输出片段。在LoCoMo与LongMemEval-S评测中,DeferMem超越强基线,在问答准确率与系统效率上均领先,实现最高准确率、最快运行速度,且内存操作零商业API Token成本。
原文摘要 · Abstract (English)
Large language model (LLM) agents still struggle with long-term memory question answering, where answer-supporting evidence is often scattered across long conversational histories and buried in substantial irrelevant content. Existing memory systems typically process memory before future queries are known, then retrieve the resulting units based on similarity rather than their utility for answering the query. This workflow leaves downstream answerers to denoise retrieved candidates and reconstruct query-specific evidence. We present DeferMem, a long-term memory framework that decouples this problem into high-recall candidate retrieval and query-conditioned evidence distillation. DeferMem uses a lightweight segment-link structure to organize raw history and retrieve broad candidates at query time. It then applies a memory distiller trained with DistillPO, our reinforcement learning algorithm for distilling the high-recall but highly noisy candidates into a set of faithful, self-contained, and query-conditioned evidence. DistillPO formulates post-retrieval evidence distillation as a structured action comprising message selection and evidence rewriting. It optimizes this action with a decomposed-and-gated reward pipeline and structure-aligned advantage assignment, gating reward components from validity to quality checks while exposing task-level correctness feedback early and assigning each reward to its responsible output span. On LoCoMo and LongMemEval-S, DeferMem surpasses strong baselines in QA accuracy and memory-system efficiency, achieving the highest QA accuracy with the fastest runtime and zero commercial-API token cost for memory operations.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。