不训练、纯CPU下融合词法与稠密检索,显著提升长对话记忆召回效果。
Training-Free Lexical-Dense Fusion for Conversational-Memory Retrieval
- 用单权重融合稠密相似度与BM25,实现无需训练的高效检索
- 在六个编码器上提升Hit@1达8.8至17.2点,最高达0.752
- 适用于多跳和时间相关问题,但对对抗性查询效果有限
在长时对话记忆(LoCoMo, LongMemEval)中,从多会话历史中精准检索出回答新查询的少数历史回合是核心瓶颈。近期工作Nano-Memory表明,通过最大查询-回合相似度评分(晚期交互,'回合隔离检索')优于均值池化会话嵌入。本文不重复该现象,而是在此基础上探索无需训练、仅限CPU的检索阶段应如何改进。研究发现:(1)将晚期交互稠密得分与BM25进行评分级融合,在六个编码器上平均提升LoCoMo Hit@1 8.8~17.2点(所有p<1e-4),达到Hit@1 0.752 / NDCG@5 0.829(e5-large-v2),比BM25高11.2个百分点;(2)使用现成网络搜索交叉编码器重排序前10结果反而使Hit@1下降6.9个百分点;(3)池化操作对比显示,top-k晚交互匹配最大相似度,但平滑最大值(log-sum-exp)在半数编码器上失效;(4)晚期减早期差距在所有六种编码器中均显著,且随模型增大而扩大,但融合增益边际递减。在LongMemEval-S上,当词法方法饱和时,融合净增益小且不显著。按类别分析表明,稠密晚交互在多跳和时间类问题上优势明显,但在对抗性问题上落后于BM25。贡献在于提供了一个可控、可复现的强无训练检索方案,而非晚期交互检索器本身(即Nano-Memory)。本研究仅聚焦检索阶段,不涉及完整记忆架构。
原文摘要 · Abstract (English)
Retrieving the few past turns that answer a new query across long multi-session histories is the retrieval bottleneck behind long-term conversational memory (LoCoMo, LongMemEval). Recent concurrent work, Nano-Memory, shows that scoring a session by the maximum query-turn similarity (late interaction, "Turn Isolation Retrieval") beats mean-pooled session embeddings. We do not claim that effect; we replicate it and ask what a training-free, CPU-only retrieval stage should add around it. We report four findings. (1) Fuse: score-level fusion of the late-interaction dense score with BM25, under a single leave-one-conversation-out weight, adds +8.8 to +17.2 points of LoCoMo Hit@1 over late interaction alone across six encoders (all p<1e-4), reaching Hit@1 0.752 / NDCG@5 0.829 (e5-large-v2), +11.2 pp over BM25. (2) An off-the-shelf web-search cross-encoder reranker over the fused top-10 hurts here, degrading Hit@1 by 6.9 pp (one reranker, one configuration). (3) A pooling-operator ablation shows top-k late interaction matches max-similarity, but a naive smooth-max (log-sum-exp) collapses for half the encoders. (4) The late-minus-early gap is large for all six encoders and tends to be larger for larger ones, while the marginal fusion gain shrinks; on LongMemEval-S, a lexical regime where BM25 saturates, the net fusion gain over BM25 is small and not significant. A per-category analysis frames the gain as a division of labor: dense late interaction helps most on multi-hop and temporal questions but trails BM25 on adversarial ones. The contribution is a controlled, reproducible account of a strong training-free retrieval recipe, not the late-interaction retriever itself (Nano-Memory's). We make no claim to a complete memory architecture; this is a retrieval-stage study.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。