提出SAGE门控机制,让智能体高效判断新记忆是否值得保留。
SAGE: A Novelty Gate for Efficient Memory Evolution in Agentic LLMs

- 基于球面密度估计动态判断记忆新旧,自适应阈值跟踪记忆结构。
- 在LoCoMo上比Mem0平均提升token-F1,GPT-4o-mini调用成本降3.4倍。
- 可减少16%-18%的LLM调用,适合长期运行的智能体系统使用。
智能体大模型需持续判断新提取信息是否应加入、合并或忽略,但现有工作更关注检索与存储,缺乏对写入端的系统性控制。本文将记忆演化视为新颖性检测问题,提出SAGE——一种基于冯·米塞斯-费舍尔分布的球面自适应门控机制,通过记忆嵌入的密度估计评分候选事实,并以随记忆库结构动态调整的阈值进行路由。SAGE能明确识别新内容(ADD)、冗余内容(NOOP),仅将不确定项送入昂贵的LLM合并步骤,显著降低写入时推理开销。在LoCoMo数据集上,SAGE在所有七个开源权重基线中均取得最佳平均token-F1;在GPT-4o-mini上,其添加阶段API成本降低3.4倍,延迟降低2.5倍,仅带来微小的平均判别得分差距。作为A-Mem的即插即用二元门控,SAGE在五种模型上跳过约16%-18%的LLM调用,对开源权重基线性能影响极小。结果表明,新颖性感知的写入控制是提升长期智能体记忆质量与系统效率的有效手段。源代码已公开于 https://github.com/swang1024/SAGE。
原文摘要 · Abstract (English)
Agentic LLMs must continuously decide whether newly extracted facts should be added, merged with existing memories, or ignored, yet prior work has focused more on retrieval and storage than on principled write-side control. We frame memory evolution as a novelty-detection problem and propose SAGE, a Spherical Adaptive Gate for memory Evolution that scores candidate facts with a von Mises-Fisher-based density estimator over memory embeddings and routes them with an adaptive threshold that tracks memory-store geometry. SAGE resolves clearly novel facts as ADD, clearly redundant facts as NOOP, and sends only uncertain cases to an LLM merge step, reducing expensive write-time reasoning. On LoCoMo, SAGE achieves the best average token-F1 against Mem0 on all seven open-weight backbone comparisons, while on GPT-4o-mini it reduces add-phase API cost by 3.4$\times$ and add-phase latency by 2.5$\times$ with only a small average judge-score gap. As a drop-in binary gate for A-Mem, SAGE skips roughly 16-18% of LLM calls across five models with minimal quality change on open-weight backbones. These results suggest that novelty-aware write control is a practical lever for improving both memory quality and system efficiency in long-term agentic memory. The source code for our approach is accessible at https://github.com/swang1024/SAGE.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。