BRIO: Bringing Order to Abstractive Summarization

By Yixin Liu, Pengfei Liu, Dragomir R. Radev, Graham Neubig. Annual Meeting of the Association for Computational Linguistics, 2022

333 citations recorded by the source corpus.

Abstractive summarization models are commonly trained using maximum likelihood estimation, which assumes a deterministic (one-point) target distribution in which an ideal model will assign all the probability mass to the reference summary. This assumption may lead to performance degradation during inference, where the model needs to compare several system-generated (candidate) summaries that have deviated from the reference summary. To address this problem, we propose a novel training paradigm which assumes a non-deterministic distribution so that different candidate summaries are assigned probability mass according to their quality. Our method achieves a new state-of-the-art result on the CNN/DailyMail (47.78 ROUGE-1) and XSum (49.07 ROUGE-1) datasets. Further analysis also shows that our model can estimate probabilities of candidate summaries that are more correlated with their level of quality.

Subfields: Artificial Intelligence, Signal Processing

View Paper: https://www.semanticscholar.org/paper/58c9838b45edad4b7fc11bd7119f113ea5a3d7f1

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. Caiming Xiong
  3. Percy Liang
  4. Graham Neubig
  5. Luke S. Zettlemoyer
  6. Jianfeng Gao
  7. Greg Durrett
  8. Yejin Choi

In Signal Processing

  1. Dragomir R. Radev
  2. Pengfei Liu
  3. Mohammad Saleh
  4. Percy Liang
  5. K. McKeown
  6. Qun Liu
  7. John Wieting
  8. Greg Durrett

Citations in the corpus