让大模型统一管理记忆,自动判断存删改查,提升长程推理能力。
Verifiable Memory: Learning Unified Memory Management with Local and Global Verifiers for Large Language Model Agents

- 用一套策略统一控制长期、短期和历史记忆,支持七种原子操作。
- 在五个基准上超越主流方法,在有限上下文下表现最优。
- 通过局部与全局验证器训练,实现精准的决策反馈,适合复杂任务代理。
大型语言模型代理需保留可复用信息,控制有限的活跃上下文,并在长周期交互中恢复早期证据。现有方法通常分别优化长期记忆(LTM)与短期记忆(STM),而统一策略多依赖轨迹级反馈,难以对具体记忆决策提供有效信用分配。本文提出可验证记忆(Verifiable Memory, VerMem),将LTM、活跃上下文与情景历史视为独立状态,由单一记忆操作策略进行控制。该策略支持七种原子操作:添加、修改或软删除LTM条目;将LTM检索至活跃上下文;过滤或总结活跃上下文;恢复选定的情景片段。VerMem通过监督微调初始化,并采用三阶段强化学习课程进行训练。局部验证器评估可执行的记忆转换,全局验证器在任务完成后评估证据连贯性与最终记忆一致性。这些评分结合程序化生成的任务、证据召回、效率与约束信号,通过分层信用分配机制进行整合。验证器仅用于训练阶段。在五个基准与两个LLM主干上,VerMem在多数指标上取得最佳表现,显著优于强基线。在三个交互式基准上,受控在线令牌预算条件下,其效率-性能前沿优于所有对比方法。代码已开源:https://github.com/Sun-SYSU-24/VerMem。
原文摘要 · Abstract (English)
Large language model (LLM) agents must retain reusable information, control a bounded active context, and recover earlier evidence during long-horizon interaction. Existing methods commonly optimize long-term memory (LTM) and short-term memory (STM) separately, while unified policies are often trained primarily with trajectory-level feedback, which provides weak credit for individual memory decisions. We present Verifiable Memory (VerMem), a framework that represents LTM, active context, and episodic history as distinct states and controls them with one memory operation policy. Seven atomic operations let the policy add, revise, or soft-delete LTM entries; retrieve LTM into the active context; filter or summarize the active context; and restore selected episodic fragments. VerMem is initialized by supervised fine-tuning and trained with a three-stage reinforcement-learning curriculum. The local verifier scores executable memory transitions, and a global verifier assesses evidence coherence and terminal-memory consistency after task completion. These scores are combined with programmatically computed task, evidence-recall, efficiency, and constraint signals through hierarchical credit assignment. The verifiers are used only during training. Across five benchmarks and two LLM backbones, VerMem achieves the best result on the vast majority of reported metrics and consistently outperforms strong memory baselines. Under controlled online-token budgets on three interactive benchmarks, it also achieves the strongest efficiency--performance frontier among the compared methods. Code is available at https://github.com/Sun-SYSU-24/VerMem.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。