动态构建摘要树,让大模型更准地回答复杂问题。
DTCRS: Dynamic Tree Construction for Recursive Summarization
- 根据问题类型决定是否建树,避免无意义摘要
- 用子问题嵌入做聚类中心,减少冗余节点50%以上
- 适合需要多步推理的复杂问答,提升准确率
检索增强生成(RAG)通过引入外部知识缓解大模型幻觉问题。递归摘要通过聚类文本块构建层次化摘要树,整合文档多部分信息,支持涉及多步推理的抽象问题回答。然而,摘要树常包含大量冗余摘要节点,不仅增加构建时间,还可能影响问答效果。且递归摘要并非适用于所有问题类型。本文提出DTCRS方法,基于文档结构与查询语义动态生成摘要树:先分析问题类型判断是否需建树,再对问题进行分解,以子问题嵌入作为初始聚类中心,有效减少冗余摘要,提升摘要与问题的相关性。实验显示,该方法显著缩短摘要树构建时间,并在三个问答任务中实现显著性能提升。此外,研究揭示了递归摘要在不同问题类型上的适用性,为未来研究提供重要参考。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。