TY - GEN
T1 - Factually Consistent Summarization via Reinforcement Learning with Textual Entailment Feedback
AU - Roit, Paul
AU - Ferret, Johan
AU - Shani, Lior
AU - Aharoni, Roee
AU - Cideron, Geoffrey
AU - Dadashi, Robert
AU - Geist, Matthieu
AU - Girgin, Sertan
AU - Hussenot, Léonard
AU - Keller, Orgad
AU - Momchev, Nikola
AU - Ramos, Sabela
AU - Stanczyk, Piotr
AU - Vieillard, Nino
AU - Bachem, Olivier
AU - Elidan, Gal
AU - Hassidim, Avinatan
AU - Pietquin, Olivier
AU - Szpektor, Idan
N1 - Publisher Copyright: © 2023 Association for Computational Linguistics.
PY - 2023
Y1 - 2023
N2 - Despite the seeming success of contemporary grounded text generation systems, they often tend to generate factually inconsistent text with respect to their input. This phenomenon is emphasized in tasks like summarization, in which the generated summaries should be corroborated by their source article. In this work we leverage recent progress on textual entailment models to directly address this problem for abstractive summarization systems. We use reinforcement learning with reference-free, textual-entailment rewards to optimize for factual consistency and explore the ensuing tradeoffs, as improved consistency may come at the cost of less informative or more extractive summaries. Our results, according to both automatic metrics and human evaluation, show that our method considerably improves the faithfulness, salience and conciseness of the generated summaries.
AB - Despite the seeming success of contemporary grounded text generation systems, they often tend to generate factually inconsistent text with respect to their input. This phenomenon is emphasized in tasks like summarization, in which the generated summaries should be corroborated by their source article. In this work we leverage recent progress on textual entailment models to directly address this problem for abstractive summarization systems. We use reinforcement learning with reference-free, textual-entailment rewards to optimize for factual consistency and explore the ensuing tradeoffs, as improved consistency may come at the cost of less informative or more extractive summaries. Our results, according to both automatic metrics and human evaluation, show that our method considerably improves the faithfulness, salience and conciseness of the generated summaries.
UR - https://www.scopus.com/pages/publications/85174388494
U2 - 10.18653/v1/2023.acl-long.344
DO - 10.18653/v1/2023.acl-long.344
M3 - Conference contribution
T3 - Proceedings of the Annual Meeting of the Association for Computational Linguistics
SP - 6252
EP - 6272
BT - Long Papers
PB - Association for Computational Linguistics (ACL)
T2 - 61st Annual Meeting of the Association for Computational Linguistics, ACL 2023
Y2 - 9 July 2023 through 14 July 2023
ER -