arXiv:2605.28062cs.CLcs.IR2026-05被引 2

轻量级记忆重排序器,效率远超主流模型且机制透明。

ConvMemory: A Lightweight Learned Memory Reranker, a Negative Attribution Result, and a Research-Preview Conflict Editor

  • 用融合稠密与词法特征的交叉编码器蒸馏训练,仅360万参数。
  • 在长程记忆检索中,延迟低至对手1/117,召回率差距小于0.025。
  • 揭示了所谓时间窗口机制实为泛化蒸馏效果,适合关注效率与可解释性的研究者。

我们提出ConvMemory,一个仅360万参数的轻量级对话长期记忆重排序器,基于融合稠密与词法特征,通过交叉编码器教师监督训练。在LongMemEval数据集上,ConvMemory在召回率@10上优于BGE-large,延迟降低12-47倍;相比mxbai-rerank-large-v1,在Clean500上召回率差距小于0.025,成本仅为后者的1/28;在Stress1000干扰场景下,召回差距扩大至0.081,但延迟仍低117倍。这些结果为单次运行或单种子,仅作成本前沿参考,非基准标准。进一步分析显示,先前声称的时间窗口机制在整体上显著,但非时间特异性,对多跳时间查询无显著影响,实际为跨特征空间的廉价交叉编码器蒸馏。我们还发布CCGE-LA,一种低幅值冲突感知候选集编辑器,作为研究预览,在LoCoMo的覆盖与过时/救援片段上取得稳定小幅提升。所有结果均在检索阶段,ConvMemory未达到mxbai-rerank-large-v1的绝对性能,报告由单作者完成,尚未独立审计。

原文摘要 · Abstract (English)

We describe ConvMemory, a small 3.6M-parameter learned reranker for conversational long-term memory retrieval, trained with cross-encoder teacher supervision over fused dense and lexical features. On the LongMemEval memory family, ConvMemory operates above the BGE-large cross-encoder in Recall@10 at 12-47x lower latency, remains within 0.025 Recall@10 of mxbai-rerank-large-v1 on Clean500 while running 28x cheaper; under Stress1000 distractors the Recall@10 gap widens to 0.081 but ConvMemory still operates at 117x lower latency; these LongMemEval numbers are single-run or single-seed and are reported as indicative cost-frontier evidence, not benchmark-grade. We then publish a rigorous negative attribution result on a previously claimed mechanism: a five-seed retrained ablation with paired bootstrap shows that ConvMemory's learned temporal window is statistically significant on aggregate but not temporally specific, with the largest effects on hard non-temporal controls and no significant effect on multi-hop temporal queries. The honest description of the mechanism is cheap cross-encoder distillation in a fused dense+lexical feature space, not temporal-structure exploitation. We additionally release CCGE-LA, a low-amplitude conflict-aware candidate-set editor over ConvMemory, as a research preview with modest but consistent gains on supersession and stale/rescue slices on LoCoMo. All results are retrieval-stage; ConvMemory does not match mxbai-rerank-large-v1 in absolute LoCoMo MRR, and the report is single-author and not yet independently audited.

记忆检索轻量模型重排序可解释性

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