Answers Unite! Unsupervised Metrics for Reinforced Summarization Models

Thomas Scialom, Sylvain Lamprier, Benjamin Piwowarski, Jacopo Staiano
9/4/2019
cs.CLcs.AIcs.IR

Official code: ThomasScialom/summa-qa (14 stars, Apache-2.0, last commit 2023-06-12).

Abstract

Abstractive summarization approaches based on Reinforcement Learning (RL) have recently been proposed to overcome classical likelihood maximization. RL enables to consider complex, possibly non-differentiable, metrics that globally assess the quality and relevance of the generated outputs. ROUGE, the most used summarization metric, is known to suffer from bias towards lexical similarity as well as from suboptimal accounting for fluency and readability of the generated abstracts. We thus explore and propose alternative evaluation measures: the reported human-evaluation analysis shows that the proposed metrics, based on Question Answering, favorably compares to ROUGE -- with the additional property of not requiring reference summaries. Training a RL-based model on these metrics leads to improvements (both in terms of human or automated metrics) over current approaches that use ROUGE as a reward.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Supporting code for the EMNLP 2019 paper "Answers Unite! Unsupervised Metrics for Reinforced Summarization Models"

148PythonAug 30, 20193 years agoApache-2.0

Cite this paper

@article{scialom2019answers,
  title  = {Answers Unite! Unsupervised Metrics for Reinforced Summarization Models},
  author = {Thomas Scialom and Sylvain Lamprier and Benjamin Piwowarski and Jacopo Staiano},
  year   = {2019},
  eprint = {1909.01610},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1909.01610}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1909.01610.svg)](https://codeofpaper.com/paper/1909.01610)

Discussion