paper-with-me

Papers

DTCRS: Dynamic Tree Construction for Recursive Summarization

2026-04-08 · Guanran Luo, Zhongquan Jian, Wentao Qiu, Meihong Wang, Qingqiang Wu arxiv

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.

📄 PDF Abstract BibTeX arXiv:2604.07012

Code (0)

등록된 구현이 없습니다.

Tasks

Question Answering

Similar Papers 제목 키워드 기반

Recursive Abstractive Processing for Retrieval in Dynamic Datasets

2024-10-02 · Charbel Chucri, Rami Azouz, Joachim Ott

Recent retrieval-augmented models enhance basic methods by building a hierarchical structure over retrieved text chunks through recursive embedding, clustering, and summarization. The most relevant information is then re…

ClusteringRetrieval

RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrieval

2024-01-31 · Parth Sarthi, Salman Abdullah, Aditi Tuli, Shubh Khanna 외

Retrieval-augmented language models can better adapt to changes in world state and incorporate long-tail knowledge. However, most existing methods retrieve only short contiguous chunks from a retrieval corpus, limiting h…

Question AnsweringRetrieval

Coresets for Decision Trees of Signals

2021-10-07 · NeurIPS 2021 12 · Ibrahim Jubran, Ernesto Evgeniy Sanches Shayda, Ilan Newman, Dan Feldman

A $k$-decision tree $t$ (or $k$-tree) is a recursive partition of a matrix (2D-signal) into $k\geq 1$ block matrices (axis-parallel rectangles, leaves) where each rectangle is assigned a real label. Its regression or cla…

Unsupervised Abstractive Opinion Summarization by Generating Sentences with Tree-Structured Topic Guidance

2021-06-15 · Masaru Isonuma, Junichiro Mori, Danushka Bollegala, Ichiro Sakata

This paper presents a novel unsupervised abstractive summarization method for opinionated texts. While the basic variational autoencoder-based models assume a unimodal Gaussian prior for the latent code of sentences, we …

Abstractive Text SummarizationOpinion SummarizationSentence

Unsupervised Neural Single-Document Summarization of Reviews via Learning Latent Discourse Structure and its Ranking

2019-06-13 · ACL 2019 7 · Masaru Isonuma, Junichiro Mori, Ichiro Sakata

This paper focuses on the end-to-end abstractive summarization of a single product review without supervision. We assume that a review can be described as a discourse tree, in which the summary is the root, and the child…

Abstractive Text SummarizationDocument SummarizationSentence