让智能体记住过往检索经验,用旧评分省下新算力。
The Retriever Should Remember: Experience-Amortized Reranking for Long-Term Agent Memory

- 用在线矩阵存历史查询-记忆相关性评分,共享结构由因果矩阵补全。
- 仅17.5%候选记忆直接计算,其余用预测评分,准确率提升6.62%。
- 适合长期对话、记忆密集型智能体,降低大模型重排序开销。
长期语言模型智能体在交互中积累记忆,但其检索器通常不积累检索经验。语义检索高效,但嵌入相似性并不总反映记忆是否包含当前查询的相关证据。大语言模型(LLM)重排序器可提供更强的查询相关性评分,但无状态重排序需重复对大量候选集评分,并在每次查询后丢弃这些分数。我们提出EARM,一种经验摊销重排序框架,将先前获取的LLM相关性评分视为可复用的检索经验。EARM在在线矩阵中存储稀疏的查询-记忆相关性评分,通过因果矩阵补全学习其共享结构,并结合少量新观测评分与估计评分对剩余候选进行重排序。随着经验积累,评分预算逐渐减少,使LLM重排序从每次查询的重复开销转变为智能体生命周期内习得的检索能力。在长期对话记忆上的实验表明,混合观测与估计重排序相比语义检索,答案准确率最高提升6.62%,且在仅17.5%候选接收直接LLM相关性评分时仍有效,显著降低了LLM重排序的推理开销。这些结果促使我们重新思考智能体记忆:一个长寿命智能体不仅应记住过去内容,也应记住这些内容在检索中的实际效用。
原文摘要 · Abstract (English)
Long-term language-model agents accumulate memories across interactions, but their retrievers typically do not accumulate retrieval experience. Semantic retrieval is efficient, but embedding similarity does not always reflect whether a memory contains evidence relevant to the current query. Large language model (LLM) rerankers provide stronger query-conditioned relevance scores, yet stateless reranking repeatedly scores a large candidate pool and discards these scores after each query. We introduce EARM, an experience-amortized reranking framework that treats previously acquired LLM relevance scores as reusable retrieval experience. EARM stores sparse query--memory relevance scores in an online matrix, learns their shared structure through causal matrix completion, and combines a small set of newly observed scores with estimated scores to rerank the remaining candidates. The scoring budget decreases as experience accumulates, changing LLM reranking from a repeated per-query expense into a retrieval capability learned over an agent's lifetime. Experiments on long-term conversational memory show that mixed observed-and-estimated reranking improves answer accuracy over semantic retrieval by up to 6.62% and remains effective when only 17.5% of candidates receive direct LLM relevance scores, thereby substantially reducing the inference overhead of LLM reranking. These results motivate a broader view of agent memory: a long-lived agent should remember not only past content, but also how that content has proved useful for retrieval.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。