BRIO: Bringing Order to Abstractive Summarization

Code

• github.com/yixinl7/brio
  OfficialIn paperpytorch★ 337
• github.com/webis-de/summary-workbench
  pytorch★ 33
• github.com/griff4692/edu-sum
  jax★ 9

Abstract

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.

Tasks

Benchmark Results

Reproductions