DTCRS: Dynamic Tree Construction for Recursive Summarization

arXiv cs.CL / 4/9/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper proposes DTCRS (Dynamic Tree Construction for Recursive Summarization) to make RAG-style recursive summarization more efficient and more aligned with question needs.
  • DTCRS reduces redundant summary nodes by generating summary trees dynamically using document structure and query semantics, including question-type analysis to decide when a tree is necessary.
  • It decomposes complex questions into sub-questions and uses their embeddings as initial cluster centers to improve the relevance of summaries to multi-step evidence-based QA.
  • The authors report significant reductions in summary-tree construction time and substantial gains across three QA tasks, alongside an analysis of which question types benefit from recursive summarization.
  • The work provides practical guidance for applying recursive summarization selectively, rather than universally, to avoid quality or latency issues on unsuitable queries.

Abstract

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.