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. |
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. |
Summary Level Training of Sentence Rewriting for Abstractive Summarization (D19-54)
Copied to clipboard
| Challenge: | Existing models rely on sentence-level rewards or suboptimal labels to achieve summary-level ROUGE scores. |
| Approach: | They propose a model that extracts salient sentences from a document and paraphrases them to generate a summary. |
| Outcome: | The proposed model improves on CNN/Daily Mail and New York Times datasets. |
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. |
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. |
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. |
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. |
Ranking Sentences for Extractive Summarization with Reinforcement Learning (N18-1)
Copied to clipboard
| Challenge: | Abstractive summarization involves various text rewriting operations and has been identified as a sequence-to-sequence problem. |
| Approach: | They propose a novel algorithm which globally optimizes the ROUGE evaluation metric through a reinforcement learning objective. |
| Outcome: | The proposed algorithm outperforms state-of-the-art extractive and abstractive systems when evaluated automatically and by humans. |
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. |
Deep Reinforcement Learning for NLP (P18-5)
Copied to clipboard
| Challenge: | Many natural language processing tasks can be formulated as deep reinforcement learning (DRL) problems. |
| Approach: | This tutorial provides an introduction to the foundations of deep reinforcement learning . it describes recent advances in designing deep reinforcement for NLP . |
| Outcome: | This tutorial provides an introduction to the foundations of deep reinforcement learning and some practical solutions for NLP tasks. |
Reinforcement Learning for Abstractive Question Summarization with Question-aware Semantic Rewards (2021.acl-short)
Copied to clipboard
| Challenge: | Existing methods for summarizing long questions are difficult due to the lack of training data and the complexity of the related subtasks. |
| Approach: | They propose a reinforcement learning-based framework for abstractive question summarization that rewards question-type identification and question-focus recognition for regularizing the question generation model. |
| Outcome: | The proposed method achieves higher performance over state-of-the-art models on two benchmark datasets. |