Skip to content
Preprint

Loss-Based Active Learning for Neural Abstractive Summarization

Aug 2026 · 0 citations · 36 references
Computer Science

TL;DR

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.

Abstract

Fine-tuning abstractive summarization models requires high-quality annotated data. However, obtaining such corpora is expensive and time-consuming, as it requires human annotators to read and comprehend long documents to create accurate summaries. Active learning mitigates this issue by selecting only the most informative instances for annotation, allowing models to achieve competitive results with significantly fewer labels. However, the application of active learning to summarization remains under-explored, and existing studies often suffer from instability and significant computational bottlenecks. To overcome these challenges, we propose LOBSTER (LOss-BaSed acTivE leaRning), a novel active learning framework designed specifically for abstractive summarization. LOBSTER 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. Our empirical evaluation across three benchmark datasets and two summarization backbone models demonstrates that LOBSTER consistently matches or outperforms current state-of-the-art approaches while achieving a query selection speedup of up to 665x.

View source

Similar papers

2026

Assessing Transformer Models for Abstractive Summarization of Scientific Articles

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 · 0 citations
Conference Jul 2026

BERT–BiLSTM based Extractive Text Summarization for Improved Information Retrieval and Efficient Knowledge Representation

AI-based text summarization plays a critical role in managing the rapidly increasing volume of textual information by enabling efficient information retrieval and concise knowledge representation. Conventional summarization approaches often rely on heuristic rules and surface-level features, limiting their ability to c...

Dr. RakeshKumar ER, S. Ramachandran, Ayushi Khandal et al. · 0 citations
Preprint Aug 2026

MIDAS: Multi-LLM Iterative Data-Adaptive Summarization

This work proposes Multi-LLM Iterative Data-Adaptive Summarization (MIDAS), a multi-LLM framework that extends this paradigm with data-driven pattern learning and use-case-specific personalization, enabling automatic adaptation to different summarization requirements without manual prompt engineering.

Karen Lee, D. Balaram, Seojun Shon et al. · 0 citations
#artificial intelligence Preprint Sep 2026

DocHop: Benchmarking Out-of-domain Multi-hop Reasoning in Information-Dense Documents

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.

Zhuoran Yu, Le Thien Phuc Nguyen, Jaden Park et al. · 1 citation
Jul 2026

Distilling large language models for code generation via ranking supervision.

This work proposes a distillation approach based on ranking supervision that consistently outperforms supervised fine-tuning as well as FKL and RKL baselines in Python code generation, multilingual generation, and data-science scenarios and offers guidance for future research in model compression.

Zhe Ding, Hui Ji, Su Pan et al. · 0 citations
#natural language process... Preprint Sep 2026

TIAO: Token Importance-Aware Policy Optimization for Text Summarization

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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.