Understanding LLM Reasoning for Abstractive Summarization

Read full text
Authors: Haohan Yuan, Haopeng Zhang
Cited by: 0

Abstract

Reasoning has substantially improved Large Language Models (LLMs) on analytical tasks such as mathematics and code generation, but its value for abstractive summarization remains unclear.To address this gap, we adapt general reasoning strategies to the summarization setting and conduct a large-scale comparative study of 8 reasoning strategies and 3 Large Reasoning Models (LRMs) across 8 diverse datasets, evaluating both summary quality and factual faithfulness.Our results show that reasoning is not a universal solution and its effectiveness depends strongly on the strategy and the summarization setting.In particular, we find a trade-off between summary quality and factual faithfulness.Explicit reasoning strategies often improve reference-based quality, but may weaken factual grounding, whereas implicit reasoning in LRMs shows the opposite tendency.We further find that increasing an LRM's internal reasoning budget does not reliably improve summarization and can even reduce factual consistency.These findings suggest that, for summarization, more reasoning is not always better.Effective reasoning should preserve faithful compression rather than induce over-elaboration.Our source code is publicly available.

Fields of Study & Subjects

Topic Modeling Natural Language Processing Techniques Machine Learning in Materials Science

Publication details

Journal / source
Findings of the Association for Computational Linguistics: ACL 2026
Publisher
Association for Computational Linguistics
Pages
17360–17386
Publication date
1 January 2026