Jul 2026· ACM Transactions on Intelligent Systems and Technology· Vol 17, pp. 1 - 40· 0 citations· 39 references
TL;DR
This work proposes and addresses a new task, MU for LLM-based Summarization (MU4Sum), and extends traditional MU methods to operate at the token level, which improves the performance of the traditional pipeline and proposes to integrate MU4Sum into an extractive-then-abstractive summarization pipeline.
Abstract
Aspect-based Summarization (AbSum) aims to generate document summaries describing different facets of the content. The summaries produced by a Large Language Model (LLM) fine-tuned for AbSum likely cover all aspects in the training set, even though some of them may be undesired. Machine Unlearning (MU) techniques are designed to remove the influence of specific training samples from trained models. Applying MU to disentangle fine-tuned LLMs from undesired aspects is particularly appealing, as it enables efficient model reuse. Despite their relevance and diffusion, MU techniques have not yet been adapted to AbSum. In this work, we bridge the gap by proposing and addressing a new task, i.e., MU for LLM-based Summarization (MU4Sum, in short). Since a document may include both aspects to forget and aspects to retain, we extend traditional MU methods to operate at the token level. Then, we empirically compare the token- and sample-wise approaches using 3 LLMs and 12 state-of-the-art MU techniques on 4 public datasets suited to MU4Sum. Our approaches perform significantly better than existing techniques on both the retain and forget test sets. Furthermore, we propose to integrate MU4Sum into an extractive-then-abstractive summarization pipeline, where the content discarded by an extractive summarizer is treated as the forget set. MU4Sum improves the performance of the traditional pipeline, highlighting its potential for broader applications.
Token Importance-Aware Policy Optimization is proposed, a novel reinforcement learning strategy that explicitly leverages token-importance awareness and identifies core tokens based on token dependency and reweights a trajectory's advantage according to its overall dependencies.
Qi-Xiu Li, Chen-Long Bao, Xiang Zhu et al.· 0 citations
This work proposes LOBSTER, a novel active learning framework designed specifically for abstractive summarization that improves performance by prioritizing unlabeled instances semantically similar to the model's current high-loss training examples, enabling the model to explicitly correct its specific weaknesses.
M. Ioannou, Tatiana Passali, George Michalopoulos et al.· 0 citations
The results show that BART achieves the best performance with an ROUGE-2 F1-score of 0.40664, while T5 demonstrates superior grammatical acceptability, achieving 93.36%, but BART achieves a very near performance to T5.
Emad Nabil· Islamic University Journal o...· 0 citations
MGAL is the first multilingual, granularity- and position-aware long-context benchmark, constructed from United Nations reports spanning 8K to 128K tokens across the six official UN languages, and finds that LLMs perform well at word-level tasks but struggle with coarser-grained ones.
Chunhan Li, Chenglin Xu, Zongyang Zhang et al.· 0 citations
This work introduces DocHop, a benchmark for integrated chart--context reasoning in document-style images and constructs DocHop via a stochastic logic-first generation pipeline with controllable reasoning depth and visual density, to enable systematic evaluation.
Zhuo-Ran Yu, Le Thien Phuc Nguyen, Jaden Park et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.