Better Rewards Yield Better Summaries: Learning to Summarise Without References (D19-1)
Copied to clipboard
| Challenge: | Reinforcement Learning (RL)-based document summarisation systems produce state-of-the-art performance in terms of ROUGE scores, but high summaries receive low human judgement. |
| Approach: | They propose to learn a reward function from human ratings on 2,500 summaries to generate human-appealing summary. |
| Outcome: | The proposed reward function can generate human-appealing summaries without reference summary input. |
Similar Papers
Answers Unite! Unsupervised Metrics for Reinforced Summarization Models (D19-1)
Copied to clipboard
| Challenge: | Abstractive summarization approaches based on Reinforcement Learning (RL) have been proposed to overcome classical likelihood maximization. |
| Approach: | They propose to use Reinforcement Learning to learn the model parameters through RL techniques to overcome classical likelihood maximization. |
| Outcome: | The proposed measures favor ROUGE with the additional property of not requiring reference summaries. |
Multi-Reward Reinforced Summarization with Saliency and Entailment (N18-2)
Copied to clipboard
| Challenge: | Abstractive text summarization is the task of compressing and rewriting a long document into a short summary while maintaining saliency, directed logical entailment, and non-redundancy. |
| Approach: | They propose a novel reward function for ROUGESal and Entail to improve abstractive summarization . they use a coverage-based reward function to combine ROUGE and En Tail . |
| Outcome: | The proposed method achieves state-of-the-art results on CNN/Daily Mail dataset and strong improvements in a test-only transfer setup on DUC-2002. |
Inverse Reinforcement Learning for Text Summarization (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies show that inverse reinforcement learning (RL) training has certain disadvantages such as object mismatch and exposure bias. |
| Approach: | They propose inverse reinforcement learning (IRL) as an effective paradigm for training abstractive summarization models. |
| Outcome: | The proposed model outperforms MLE and RL baselines on ROUGE, coverage, novelty, compression ratio, factuality, and human evaluations. |
Deep Reinforcement Learning with Distributional Semantic Rewards for Abstractive Summarization (D19-1)
Copied to clipboard
| Challenge: | Abstractive summarization tasks are often based on deep reinforcement learning (RL) but the traditional reward system Rouge-L simply looks for exact n-grams matches between candidates and annotated references, which makes the generated sentences repetitive and incoherent. |
| Approach: | They propose to use distributional semantics to measure matching degrees instead of Rouge-L to generate sentences with n-grams matches. |
| Outcome: | The proposed reward has superiority over the existing reward, despite the incoherence of the generated sentences. |
Reinforcement Replaces Supervision: Query focused Summarization using Deep Reinforcement Learning (2023.emnlp-main)
Copied to clipboard
| Challenge: | Query-focused Summarization (QfS) is a system that generates summaries from document(s) based on a query. |
| Approach: | They propose a Query-focused Summarization approach that uses a generalization of Reinforcement Learning (RL) for Natural Language Generation and a better semantic similarity reward. |
| Outcome: | The proposed approach improves on the ROUGE-L metric and in a benchmark dataset. |
A Multi-Document Coverage Reward for RELAXed Multi-Document Summarization (2022.acl-long)
Copied to clipboard
| Challenge: | Multi-document summarization models are limited by limited references and with maximum-likelihood objectives. |
| Approach: | They propose to fine-tune an MDS baseline with a reward that balances a reference-based metric such as ROUGE with coverage of the input documents. |
| Outcome: | The proposed model improves on the Multi-News and WCEP datasets with a low-variance estimator . the proposed model also improves the coverage of the input documents . |
Objective Function Learning to Match Human Judgements for Optimization-Based Summarization (N18-2)
Copied to clipboard
| Challenge: | In previous work on summarization, the objective function is based on ad-hoc assumptions about which quality aspects of a summary are relevant. |
| Approach: | They learn a summary-level scoring function including human judgments as supervision and automatically generated data as regularization. |
| Outcome: | The proposed method performs well across automatic and manual evaluations. |
Reinforced Extractive Summarization with Question-Focused Rewards (P18-3)
Copied to clipboard
| Challenge: | Existing methods for extractive summarization use human abstracts to create annotations for extraction units. |
| Approach: | They propose a method where abstracts are converted to Cloze-style comprehension questions to generate extractive summarization. |
| Outcome: | The proposed method surpasses state-of-the-art systems on the standard summarization dataset. |
SUPERT: Towards New Frontiers in Unsupervised Evaluation Metrics for Multi-Document Summarization (2020.acl-main)
Copied to clipboard
| Challenge: | Existing evaluation methods for document summarization require human annotations and annotations. |
| Approach: | They propose a method which measures the quality of a summary by measuring its semantic similarity with a pseudo reference summary, using contextualized embeddings and soft token alignment techniques. |
| Outcome: | The proposed method correlates better with human ratings by 18- 39% compared to the state-of-the-art evaluation metrics. |
Factually Consistent Summarization via Reinforcement Learning with Textual Entailment Feedback (2023.acl-long)
Copied to clipboard
Paul Roit, Johan Ferret, Lior Shani, Roee Aharoni, Geoffrey Cideron, Robert Dadashi, Matthieu Geist, Sertan Girgin, Leonard Hussenot, Orgad Keller, Nikola Momchev, Sabela Ramos Garea, Piotr Stanczyk, Nino Vieillard, Olivier Bachem, Gal Elidan, Avinatan Hassidim, Olivier Pietquin, Idan Szpektor
| Challenge: | Recent advances in abstractive summarization systems produce factually inconsistent text . this is emphasized in tasks like summarizing, which often produce inconsistent text with no input article . |
| Approach: | They use reinforcement learning to optimize for factual consistency and explore trade-offs . they use textual-entailment rewards to optimize the accuracy of the generated summaries . |
| Outcome: | The proposed method improves faithfulness, salience and conciseness of the generated summaries. |