pith. sign in

BanditSum: Extractive Summarization as a Contextual Bandit

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

In this work, we propose a novel method for training neural networks to perform single-document extractive summarization without heuristically-generated extractive labels. We call our approach BanditSum as it treats extractive summarization as a contextual bandit (CB) problem, where the model receives a document to summarize (the context), and chooses a sequence of sentences to include in the summary (the action). A policy gradient reinforcement learning algorithm is used to train the model to select sequences of sentences that maximize ROUGE score. We perform a series of experiments demonstrating that BanditSum is able to achieve ROUGE scores that are better than or comparable to the state-of-the-art for extractive summarization, and converges using significantly fewer update steps than competing approaches. In addition, we show empirically that BanditSum performs significantly better than competing approaches when good summary sentences appear late in the source document.

fields

cs.AI 1 cs.CL 1

years

2025 1 2020 1

representative citing papers

Learning to summarize from human feedback

cs.CL · 2020-09-02 · conditional · novelty 7.0

Reinforcement learning on a reward model trained from human summary comparisons produces summaries humans prefer over supervised fine-tuning or human references on TL;DR and transfers to CNN/DM.

Context Attribution with Multi-Armed Bandit Optimization

cs.AI · 2025-06-24 · unverdicted · novelty 6.0

Formulates context attribution as a combinatorial multi-armed bandit problem solved via Linear Thompson Sampling to reduce LLM queries by up to 30% on QA benchmarks while matching existing attribution quality.

citing papers explorer

Showing 2 of 2 citing papers.

  • Learning to summarize from human feedback cs.CL · 2020-09-02 · conditional · none · ref 15 · internal anchor

    Reinforcement learning on a reward model trained from human summary comparisons produces summaries humans prefer over supervised fine-tuning or human references on TL;DR and transfers to CNN/DM.

  • Context Attribution with Multi-Armed Bandit Optimization cs.AI · 2025-06-24 · unverdicted · none · ref 2 · internal anchor

    Formulates context attribution as a combinatorial multi-armed bandit problem solved via Linear Thompson Sampling to reduce LLM queries by up to 30% on QA benchmarks while matching existing attribution quality.