LLM Memory & RAG 相关度: 9/10

DTCRS: Dynamic Tree Construction for Recursive Summarization

Guanran Luo, Zhongquan Jian, Wentao Qiu, Meihong Wang, Qingqiang Wu
arXiv: 2604.07012v1 发布: 2026-04-08 更新: 2026-04-08

AI 摘要

DTCRS动态构建摘要树,根据问题类型和文档结构优化RAG中的递归摘要,提升问答效率。

主要贡献

  • 提出DTCRS方法,动态构建摘要树。
  • 根据问题类型判断是否需要构建摘要树。
  • 使用子问题嵌入作为聚类中心,减少冗余摘要。

方法论

通过分析问题类型分解问题,利用子问题嵌入指导摘要树的动态构建,从而提高摘要与问题的相关性,并减少冗余。

原文摘要

Retrieval-Augmented Generation (RAG) mitigates the hallucination problem of Large Language Models (LLMs) by incorporating external knowledge. Recursive summarization constructs a hierarchical summary tree by clustering text chunks, integrating information from multiple parts of a document to provide evidence for abstractive questions involving multi-step reasoning. However, summary trees often contain a large number of redundant summary nodes, which not only increase construction time but may also negatively impact question answering. Moreover, recursive summarization is not suitable for all types of questions. We introduce DTCRS, a method that dynamically generates summary trees based on document structure and query semantics. DTCRS determines whether a summary tree is necessary by analyzing the question type. It then decomposes the question and uses the embeddings of sub-questions as initial cluster centers, reducing redundant summaries while improving the relevance between summaries and the question. Our approach significantly reduces summary tree construction time and achieves substantial improvements across three QA tasks. Additionally, we investigate the applicability of recursive summarization to different question types, providing valuable insights for future research.

标签

RAG 递归摘要 问答 知识图谱

arXiv 分类

cs.CL