Research Papers 论文研究 5h ago Updated 1h ago 更新于 1小时前 45

Less can be More: Relieving RAG Bottlenecks via Evidence Frontloading and Pressure-Adaptive Budgeting 少即是多:通过证据前置和压力自适应预算缓解RAG瓶颈

RAG systems exhibit a shifting bottleneck between upstream reranking and downstream LLM generation depending on query rates and reranking budgets, challenging the assumption that downstream optimization is always the priority PACE (Prioritized Adaptive Coverage of Evidence) is a training-free framework combining evidence frontloading and pressure-adaptive budgeting to address this shifting bottleneck Evidence frontloading reorders candidates by marginal evidence coverage, prioritizing query-rele RAG系统瓶颈可在上游reranking与下游LLM生成间转移,高查询率下reranking常成为主要瓶颈 提出PACE框架(Prioritized Adaptive Coverage of Evidence),无需训练即可结合证据前置与压力自适应预算分配 通过边际证据覆盖对候选文档重排序,优先选择相关、互补且支持多跳推理的文档,贪心选择有(1-1/e)近似保证 动态根据reranker与LLM的相对压力调整reranking预算,实现"少即是多"——更少文档获得更高召回 在三个多跳QA数据集和在线服务模拟中验证,提升证据召回率并降低p95延迟

58
Hot 热度
72
Quality 质量
65
Impact 影响力

Analysis 深度分析

TL;DR

  • RAG systems exhibit a shifting bottleneck between upstream reranking and downstream LLM generation depending on query rates and reranking budgets, challenging the assumption that downstream optimization is always the priority
  • PACE (Prioritized Adaptive Coverage of Evidence) is a training-free framework combining evidence frontloading and pressure-adaptive budgeting to address this shifting bottleneck
  • Evidence frontloading reorders candidates by marginal evidence coverage, prioritizing query-relevant, complementary documents that form multi-hop evidence chains, with a monotone submodular objective guaranteeing a (1-1/e) approximation via greedy selection
  • Pressure-adaptive budgeting dynamically adjusts the reranking budget based on the relative computational pressure between the reranker and the LLM
  • Experiments on three multi-hop QA datasets and online serving simulations demonstrate improved evidence recall and reduced p95 latency under ranking-heavy workloads, validating the "less can be more" principle

Why It Matters

This work fundamentally reframes how practitioners approach RAG efficiency by demonstrating that the bottleneck is not fixed but shifts across the pipeline, meaning optimization strategies must be workload-aware rather than one-size-fits-all. For AI engineers deploying RAG systems at scale, PACE offers a practical, training-free solution that can be integrated without retraining models, directly addressing latency and recall trade-offs that are critical for production systems. The theoretical guarantee on the submodular objective also provides a principled foundation for evidence selection that goes beyond heuristic approaches.

Technical Details

  • Shifting-bottleneck characterization: The paper empirically demonstrates that under high query rates or large reranking budgets, upstream reranking becomes the dominant bottleneck rather than downstream LLM generation, overturning the common assumption that RAG efficiency efforts should focus primarily on the generator
  • Evidence frontloading: PACE reorders retrieved candidates by marginal evidence coverage, selecting documents that are query-relevant, complementary to already-selected documents, and useful for constructing multi-hop evidence chains; the objective function is proven to be monotone submodular, enabling greedy selection with a (1-1/e) approximation guarantee
  • Pressure-adaptive budgeting: The framework dynamically allocates the reranking budget based on real-time relative pressure between the reranker and the LLM, reducing the budget when reranking is the bottleneck while preserving enough evidence for recall
  • Evaluation: Tested on three multi-hop QA datasets with online serving simulations, showing improved evidence recall and reduced p95 latency under ranking-heavy workloads, with the combined components demonstrating that fewer but more evidence-dense top-ranked candidates yield higher final recall

Industry Insight

  • Organizations running RAG at scale should monitor where bottlenecks actually sit in their pipeline rather than defaulting to downstream optimization; workload-aware budgeting can yield significant latency improvements without model changes
  • The training-free nature of PACE makes it immediately deployable in existing RAG infrastructures, offering a low-risk, high-impact optimization path for production systems facing high query throughput
  • The "less can be more" insight suggests that investing in smarter evidence selection at the reranking stage can be more effective than simply increasing context window size or reranking budget, pointing toward a design philosophy prioritizing evidence density over evidence quantity

TL;DR

  • RAG系统瓶颈可在上游reranking与下游LLM生成间转移,高查询率下reranking常成为主要瓶颈
  • 提出PACE框架(Prioritized Adaptive Coverage of Evidence),无需训练即可结合证据前置与压力自适应预算分配
  • 通过边际证据覆盖对候选文档重排序,优先选择相关、互补且支持多跳推理的文档,贪心选择有(1-1/e)近似保证
  • 动态根据reranker与LLM的相对压力调整reranking预算,实现"少即是多"——更少文档获得更高召回
  • 在三个多跳QA数据集和在线服务模拟中验证,提升证据召回率并降低p95延迟

为什么值得看

本文首次系统刻画了RAG端到端系统中瓶颈转移现象,打破了仅关注下游生成的优化范式。提出的PACE框架为实际部署中平衡效率与质量提供了可落地的无训练方案,对构建高性能多跳问答系统具有直接参考价值。

技术解析

  • 瓶颈转移分析:实证表明在高查询率或大reranking预算场景下,上游reranking会成为主导瓶颈,而非传统认为的下游LLM生成瓶颈。
  • 证据前置(Evidence Frontloading):以边际证据覆盖为目标对候选文档重排序,优先选择与查询相关、内容互补、能形成多跳证据链的文档,该目标函数被证明为单调次模函数。
  • 压力自适应预算(Pressure-Adaptive Budgeting):根据reranker与LLM的相对负载压力动态调整reranking预算,避免单一组件过载。
  • 理论保证:贪心选择策略对单调次模优化问题提供(1-1/e)近似比保证。
  • 实验验证:在三个多跳QA数据集上进行测试,并结合在线服务模拟,结果显示PACE在减少reranked文档数量的同时提升证据召回率,并显著降低p95延迟。

行业启示

  • RAG系统优化应从端到端视角出发,识别并动态适应瓶颈转移,而非仅聚焦单一组件优化。
  • "少即是多"原则在多跳推理场景中尤为关键:通过提升顶部候选的证据密度,可用更少资源实现更高性能,降低部署成本。
  • 无训练框架PACE易于集成到现有RAG流水线,为工业界快速落地高效多跳问答系统提供了可行路径。

Disclaimer: The above content is generated by AI and is for reference only. 免责声明:以上内容由 AI 生成,仅供参考。

RAG 检索增强生成 Research 科学研究 Inference 推理 LLM 大模型