IDEAL: Leveraging Infinite and Dynamic Characterizations of Large Language Models for Query-focused Summarization
Jie Cao, Dian Jiao, Qiang Yan, Wenqiao Zhang, Siliang Tang, Yueting Zhuang
TL;DR
IDEAL introduces a two-module framework for query-focused summarization that combines a Query-aware HyperExpert with a Query-focused Infini-attention mechanism to achieve fine-grained, query-conditioned adaptation and long-context processing. The HyperExpert uses a HyperNetwork to generate instance-specific PEFT adapters (LoRA, Prompt, PAdapter) conditioned on the query, while Infini-attention provides memory-compressed, query-guided attention for extremely long documents. Across CovidET, QMsum, and SQuALITY, IDEAL outperforms PEFT baselines and competitive baselines, with ablations confirming the value of query-conditioned parameter generation, HyperExpert configurations, and memory-efficient long-context processing. The work demonstrates strong practical potential for scalable, controllable QFS in real-world applications, while noting the need for book-length dataset validation in future work.
Abstract
Query-focused summarization (QFS) aims to produce summaries that answer particular questions of interest, enabling greater user control and personalization. With the advent of large language models (LLMs), shows their impressive capability of textual understanding through large-scale pretraining, which implies the great potential of extractive snippet generation. In this paper, we systematically investigated two indispensable characteristics that the LLMs-based QFS models should be harnessed, Lengthy Document Summarization and Efficiently Fine-grained Query-LLM Alignment, respectively. Correspondingly, we propose two modules called Query-aware HyperExpert and Query-focused Infini-attention to access the aforementioned characteristics. These innovations pave the way for broader application and accessibility in the field of QFS technology. Extensive experiments conducted on existing QFS benchmarks indicate the effectiveness and generalizability of the proposed approach. Our code is publicly available at https://github.com/DCDmllm/IDEAL_Summary.
