arXiv:2607.13591cs.CLcs.AI2026-07被引 1

让大模型记忆系统学会自适应调控,提升任务成功率并减少耗能

Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents

论文配图:Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents
图 1 · 摘自论文原文
  • 将记忆操作建模为可学习的决策过程,动态决定何时、如何检索
  • 在6个基准上最高提升15.2分任务成功率,同时降低5%~20% token消耗
  • 无需预训练、不依赖额外LLM调用,适配任意记忆后端,适合实用型智能体

大语言模型代理越来越依赖外部记忆系统来积累跨任务经验。然而,现有方法(如图结构记忆、反思洞察存储)均通过固定的启发式规则访问记忆。我们指出,这种静态记忆观是智能体学习的核心瓶颈,因为最优记忆行为本质上依赖上下文:任务初期记忆稀疏,应尽量少检索;重复目标类型应复用计划而非通用最近邻查找;卡住的代理需用不同查询重查;长期任务流中,记忆本身需定期整合与清理。我们提出记忆即受控过程(MemCon),将记忆操作建模为马尔可夫决策过程,学习在线策略以自适应决定何时、检索什么、检索多少、何时注入精炼计划、何时合并或遗忘。MemCon与后端无关:可封装任意现有记忆实现,仅需任务级二值反馈,无需预训练或额外LLM调用,采用轻量级表格上下文老虎机与UCB探索,数十次任务内收敛。在6个基准、3种代理框架和3种LLM骨干上,MemCon始终优于多个记忆基线,任务成功率最高提升15.2点,同时减少5%–20%的token消耗。

原文摘要 · Abstract (English)

Large Language Model (LLM) agents increasingly rely on external memory systems to accumulate experience across tasks. Yet nearly all existing approaches, from graph-structured memories to reflective insight stores, access memory through fixed, hand-designed heuristics. We argue that this static view of memory is a core bottleneck for agentic learning because optimal memory behavior is fundamentally context-dependent. The early stages of the tasks, benefit from minimal retrieval because memory is sparse; recurring goal types benefit from plan reuse rather than generic nearest-neighbor lookup; stuck agents benefit from re-retrieval with alternative queries; and across long task streams, the memory store itself must be consolidated and pruned to remain useful. We present Memory as a Controlled Process (MemCon), a framework that models memory operations as a Markov Decision Process and learns an online policy that adaptively decides when, what, and how much to retrieve, when to inject a distilled plan, and when to consolidate or forget. MemCon is backend-agnostic: it wraps any existing memory implementation, learns from task-by-task binary feedback with no pretraining and no additional LLM calls, and uses a lightweight tabular contextual bandit with UCB exploration that converges within tens of tasks. Across 6 benchmarks, 3 agent frameworks, and 3 LLM backbones, MemCon consistently outperforms multiple memory baselines by up to 15.2 points in task success while reducing token consumption by 5--20%.

记忆管理智能体自适应控制高效推理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。