arXiv:2606.18381cs.CLcs.IR2026-06

用注意力引导的树状结构,让长文档检索更准更省力。

SproutRAG: Attention-Guided Tree Search with Progressive Embeddings for Long-Document RAG

论文配图:SproutRAG: Attention-Guided Tree Search with Progressive Embeddings for Long-Document RAG
图 1 · 摘自论文原文
  • 基于句子间注意力构建分层块化树,自动组织语义单元。
  • 多粒度检索提升信息效率,平均比最强基线高6.1%。
  • 无需额外大模型调用,适合科学、法律等长文本场景。

检索增强生成(RAG)系统需在检索粒度与上下文连贯性间权衡。现有方法依赖大模型进行分块、单层级扩展或层级摘要,分别存在索引/检索成本高、仅支持单一粒度或信息损失问题。本文提出SproutRAG,一种基于注意力引导的层次化RAG框架,通过学习句子间注意力,将句级块逐步合并为语义连贯的更大单元,构建二叉分块树。该框架无需外部大模型、无压缩摘要,可端到端训练,联合优化嵌入与树结构。检索时采用层次化束搜索,在多粒度上捕捉跨句相关性。在涵盖科学、法律和开放域的四个基准测试中,平均信息效率(IE)较最强基线提升6.1%。代码已开源。

原文摘要 · Abstract (English)

Retrieval-augmented generation (RAG) systems must balance retrieval granularity with contextual coherence, a challenge that existing methods address through LLM-guided chunking, single-level context expansion, or hierarchical summarization. These approaches variously depend on costly LLM calls during indexing or retrieval, limit context aggregation to a single granularity level, or introduce information loss through summarization. We present SproutRAG, an attention-guided hierarchical RAG framework that addresses this trade-off by organizing sentence-level chunks into progressively larger but semantically coherent units, using learned inter-sentence attention to construct a binary chunking tree. Unlike prior approaches that rely on external LLMs, fixed context expansion, or lossy summarization, SproutRAG learns which attention heads and layers best capture semantic document structure, enabling multi-granularity retrieval without additional LLM calls or compressed summaries. At retrieval time, SproutRAG uses hierarchical beam search to retrieve candidates at multiple granularities, capturing multi-sentence relevance beyond flat retrieval. The framework is trained end-to-end with a joint objective that improves both embeddings and tree structure. Experiments across four benchmarks spanning scientific, legal, and open-domain settings demonstrate that SproutRAG improves information efficiency (IE) by 6.1% on average over the strongest baseline. Code is available on https://github.com/AmirAbaskohi/SproutRAG.

RAG长文档注意力检索

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