用前后双向查找提升复杂查询的检索准确率,不需微调。
FB-RAG: Improving RAG with Forward and Backward Lookup
- 通过轻量模型预判生成内容,精准定位最相关上下文。
- 在9个数据集上表现稳定,最高降低48%延迟或提升8%性能。
- 小模型引导大模型,适合追求效率与精度的部署场景。
传统检索增强生成(RAG)在复杂查询下因信号弱而难以获取最相关上下文,导致需在小上下文漏信息与大上下文混淆之间权衡。为此,我们提出无需训练的前向-后向RAG(FB-RAG),其核心是利用轻量级LLM预览潜在未来生成内容,通过多采样输出中的证据,精确识别最终生成器所需的最相关上下文。该方法无需复杂微调或强化学习,在LongBench和∞Bench共9个数据集上均表现优异。此外,由于为强大生成器构建了更短、更聚焦的提示,可实现更低延迟。在EN.QA数据集上,FB-RAG以超过48%的延迟降幅达到领先基线水平,或在仅10%延迟增加下实现8%性能提升。分析显示,即使前向探测模型未能正确生成答案,其尝试仍足以引导最终模型得出准确结果,证明小模型可系统性提升大模型的性能与效率。
原文摘要 · Abstract (English)
Traditional Retrieval-Augmented Generation (RAG) struggles with complex queries that lack strong signals to retrieve the most relevant context, forcing a trade-off between choosing a small context that misses key information and a large context that confuses the LLM. To address this, we propose Forward-Backward RAG (FB-RAG), a new training-free framework based on a simple yet powerful forward-looking strategy. FB-RAG employs a light-weight LLM to peek into potential future generations, using evidence from multiple sampled outputs to precisely identify the most relevant context for a final, more powerful generator. This improves performance without complex finetuning or Reinforcement Learning common in prior work. Across $9$ datasets from LongBench and $\infty$Bench, FB-RAG consistently delivers strong results. Further, the performance gains can be achieved with reduced latency due to a shorter, more focused prompt for the powerful generator. On EN.QA dataset, FB-RAG matches the leading baseline with over $48$% latency reduction or achieves an $8$% performance improvement with a $10$% latency reduction. Our analysis finds cases where even when the forward-looking LLM fails to generate correct answers, its attempts are sufficient to guide the final model to an accurate response, demonstrating how smaller LLMs can systematically improve the performance and efficiency of larger ones.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。