arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2610.00238cs.CLcs.AI

CAVE-Mem:面向记忆搜索的边界感知经验验证

CAVE-Mem: Boundary-Aware Experience Validation for Memory Search

Xinyu Li

首次发表
浏览论文内容

中文总结 AI 辅助

CAVE-Mem提出无需训练的边界感知经验验证框架,将经验建模为带适用性条件的干预算子,仅在匹配基底、答案契约、证据边界和效用时修改答案,否则弃权(不执行),在多项长期记忆任务上超越仅相关性复用。

中文摘要 AI 辅助

长期记忆智能体日益依赖迭代搜索和可复用经验来回答涉及大规模个人、事实或叙事历史的问题。然而,当前的经验记忆系统主要优化相关性:它们检索与当前状态相似的历史搜索教训并将其注入提示中。当记忆基底、问题意图、答案粒度或证据边界发生变化时,相关经验仍可能有害。我们提出CAVE-Mem,一个无需训练的框架,将经验表示为带适用性、边界和效用条件的类型化干预算子。CAVE-Mem首先获取基础记忆搜索答案,然后仅当算子匹配当前基底、答案契约、证据边界和交叉拟合效用时才允许其改变答案;否则系统弃权(不执行)。在长期对话记忆、多跳问答和长文档叙事推理上的实验表明,相较于仅相关性的经验复用,该方法持续获得性能提升。

英文摘要

Long-term memory agents increasingly rely on it- erative search and reusable experience to answer questions over large personal, factual, or narrative histories. However, current experience-memory systems largely optimize relevance: they re- trieve past search lessons that appear similar to the current state and inject them into the prompt. A relevant experience can still be harmful when the memory substrate, question intent, answer granularity, or evidence boundary changes. We propose CAVE- Mem, a training-free framework that represents experience as a typed intervention operator with applicability, boundary, and utility conditions. CAVE-Mem first obtains a base memory-search answer, then allows an operator to change it only if the oper- ator matches the current substrate, answer contract, evidence boundary, and cross-fitted utility; otherwise the system abstains. Experiments across long-term conversational memory, multi-hop question answering, and long-document narrative reasoning show consistent gains over relevance-only experience reuse.

发表机构

  • Kent State University(肯特州立大学)

机构由 AI 辅助整理,请以论文原文为准。

↑