用大模型自身置信度重排文档,无需训练即可提升检索效果
LLM-Confidence Reranker: A Training-Free Approach for Enhancing Retrieval-Augmented Generation Systems
- 基于大模型置信度构建无训练重排算法,利用语义聚类分析
- 在多个数据集上使NDCG@5最高提升20.6%,且不降低原有性能
- 适合医疗等高风险场景,对计算资源要求低且易于集成
大语言模型在知识密集型任务中仍存在幻觉问题。检索增强生成(RAG)通过引入外部知识缓解该问题,但其效果依赖于准确的文档检索与排序。现有重排方法常需专门训练,成本高且未能充分利用大模型的语义能力,尤其是其内在置信度信号。本文提出无需训练的LLM-Confidence Reranker(LCR),通过最大语义簇比例(MSCP)提取黑箱大模型的置信度,采用两阶段流程:先通过多项式采样与聚类进行置信度评估,再按查询和文档置信度阈值分组排序。该方法优先保留相关文档,同时对高置信度查询保持原始排序,确保鲁棒性。在BEIR与TREC基准上使用BM25和Contriever检索器测试,仅需7–9B参数预训练大模型,LCR在预训练及微调的Transformer重排器上均实现最高达20.6%的NDCG@5提升,且无性能下降。消融实验验证了大模型置信度与文档相关性正相关,揭示了机制有效性。LCR具有高效、可并行、兼容性强等优势,适用于医疗诊断等减少幻觉的应用。
原文摘要 · Abstract (English)
Large language models (LLMs) have revolutionized natural language processing, yet hallucinations in knowledge-intensive tasks remain a critical challenge. Retrieval-augmented generation (RAG) addresses this by integrating external knowledge, but its efficacy depends on accurate document retrieval and ranking. Although existing rerankers demonstrate effectiveness, they frequently necessitate specialized training, impose substantial computational expenses, and fail to fully exploit the semantic capabilities of LLMs, particularly their inherent confidence signals. We propose the LLM-Confidence Reranker (LCR), a training-free, plug-and-play algorithm that enhances reranking in RAG systems by leveraging black-box LLM confidence derived from Maximum Semantic Cluster Proportion (MSCP). LCR employs a two-stage process: confidence assessment via multinomial sampling and clustering, followed by binning and multi-level sorting based on query and document confidence thresholds. This approach prioritizes relevant documents while preserving original rankings for high-confidence queries, ensuring robustness. Evaluated on BEIR and TREC benchmarks with BM25 and Contriever retrievers, LCR--using only 7--9B-parameter pre-trained LLMs--consistently improves NDCG@5 by up to 20.6% across pre-trained LLM and fine-tuned Transformer rerankers, without degradation. Ablation studies validate the hypothesis that LLM confidence positively correlates with document relevance, elucidating LCR's mechanism. LCR offers computational efficiency, parallelism for scalability, and broad compatibility, mitigating hallucinations in applications like medical diagnosis.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。