BanditSum: Extractive Summarization as a Contextual Bandit

By Yue Dong, Yikang Shen, Eric Crawford, Herke Van Hoof, Jackie Chi Kit Cheung. 2018

189 citations recorded by the source corpus.

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.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Natural Language Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Jianfeng Gao
  3. Caiming Xiong
  4. Percy Liang
  5. Graham Neubig
  6. Xipeng Qiu
  7. Luke S. Zettlemoyer
  8. Yejin Choi

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Zhe Gan
  4. Mohit Bansal
  5. Trevor Darrell
  6. Cordelia Schmid
  7. Jianfeng Gao
  8. Xiaogang Wang

In Natural Language Processing

  1. Mohit Bansal
  2. Xipeng Qiu
  3. Pengfei Liu
  4. Caiming Xiong
  5. Graham Neubig
  6. Jianfeng Gao
  7. Yang Liu
  8. Richard Socher

Citations in the corpus