English
Related papers

Related papers: Enhancing Factuality through Consensus and Consist…

200 papers

Recent advances in machine translation (MT) have shown that Minimum Bayes Risk (MBR) decoding can be a powerful alternative to beam search decoding, especially when combined with neural-based utility functions. However, the performance of…

Computation and Language · Computer Science 2023-05-19 Markus Freitag , Behrooz Ghorbani , Patrick Fernandes

Minimum Bayes risk (MBR) decoding is a decision rule of text generation tasks that outperforms conventional maximum a posterior (MAP) decoding using beam search by selecting high-quality outputs based on a utility function rather than those…

Computation and Language · Computer Science 2024-10-22 Hiroyuki Deguchi , Yusuke Sakai , Hidetaka Kamigaito , Taro Watanabe

While instruction fine-tuned LLMs are effective text generators, sensitivity to prompt construction makes performance unstable and sub-optimal in practice. Relying on a single "best" prompt cannot capture all differing approaches to a…

Computation and Language · Computer Science 2024-10-07 David Heineman , Yao Dou , Wei Xu

Text summarizing is a critical Natural Language Processing (NLP) task with applications ranging from information retrieval to content generation. Large Language Models (LLMs) have shown remarkable promise in generating fluent abstractive…

Computation and Language · Computer Science 2025-03-03 Colleen Gilhuly , Haleh Shahzad

In Neural Machine Translation, it is typically assumed that the sentence with the highest estimated probability should also be the translation with the highest quality as measured by humans. In this work, we question this assumption and…

Computation and Language · Computer Science 2022-04-27 Markus Freitag , David Grangier , Qijun Tan , Bowen Liang

Minimum Bayes Risk (MBR) decoding is a method for choosing the outputs of a machine learning system based not on the output with the highest probability, but the output with the lowest risk (expected error) among multiple candidates. It is…

Computation and Language · Computer Science 2023-10-03 Amanda Bertsch , Alex Xie , Graham Neubig , Matthew R. Gormley

Evaluating factual consistency is essential for reliable text summarization, particularly in high-stakes domains such as healthcare and news. However, most existing evaluation metrics overlook Bangla, a widely spoken yet under-resourced…

Computation and Language · Computer Science 2026-02-20 Ahmed Rafid , Rumman Adib , Fariya Ahmed , Ajwad Abrar , Mohammed Saidul Islam

This study addresses the reliability of automatic summarization in high-risk scenarios and proposes a large language model framework that integrates uncertainty quantification and risk-aware mechanisms. Starting from the demands of…

Computation and Language · Computer Science 2025-10-03 Shuaidong Pan , Di Wu

Scoring the factuality of a generated summary involves measuring the degree to which a target text contains factual information using the input document as support. Given the similarities in the problem formulation, previous work has shown…

Computation and Language · Computer Science 2022-12-01 John Glover , Federico Fancellu , Vasudevan Jagannathan , Matthew R. Gormley , Thomas Schaaf

Factual consistency is one of important summary evaluation dimensions, especially as summary generation becomes more fluent and coherent. The ESTIME measure, recently proposed specifically for factual consistency, achieves high correlations…

Computation and Language · Computer Science 2022-01-10 Oleg Vasilyev , John Bohannon

Generating unbiased summaries in real-world settings such as political perspective summarization remains a crucial application of Large Language Models (LLMs). Yet, existing evaluation frameworks rely on traditional metrics for measuring…

Computation and Language · Computer Science 2025-06-23 Narutatsu Ri , Nicholas Deas , Kathleen McKeown

While large language models (LLMs) have proven to be effective on a large variety of tasks, they are also known to hallucinate information. To measure whether an LLM prefers factually consistent continuations of its input, we propose a new…

Computation and Language · Computer Science 2023-12-05 Derek Tam , Anisha Mascarenhas , Shiyue Zhang , Sarah Kwan , Mohit Bansal , Colin Raffel

Sequence-to-sequence neural networks have recently achieved great success in abstractive summarization, especially through fine-tuning large pre-trained language models on the downstream dataset. These models are typically decoded with beam…

Computation and Language · Computer Science 2023-05-29 Mathieu Ravaut , Shafiq Joty , Nancy F. Chen

Neural abstractive summarization models are able to generate summaries which have high overlap with human references. However, existing models are not optimized for factual correctness, a critical metric in real-world applications. In this…

Computation and Language · Computer Science 2020-04-29 Yuhao Zhang , Derek Merck , Emily Bao Tsai , Christopher D. Manning , Curtis P. Langlotz

For sequence-to-sequence tasks it is challenging to combine individual system outputs. Further, there is also often a mismatch between the decoding criterion and the one used for assessment. Minimum Bayes' Risk (MBR) decoding can be used to…

Computation and Language · Computer Science 2023-10-30 Vyas Raina , Mark Gales

Currently used metrics for assessing summarization algorithms do not account for whether summaries are factually consistent with source documents. We propose a weakly-supervised, model-based approach for verifying factual consistency and…

Computation and Language · Computer Science 2019-10-29 Wojciech Kryściński , Bryan McCann , Caiming Xiong , Richard Socher

Two-step approaches, in which summary candidates are generated-then-reranked to return a single summary, can improve ROUGE scores over the standard single-step approach. Yet, standard decoding methods (i.e., beam search, nucleus sampling,…

Computation and Language · Computer Science 2023-05-30 Griffin Adams , Alexander R. Fabbri , Faisal Ladhak , Kathleen McKeown , Noémie Elhadad

Minimum Bayes Risk (MBR) decoding has been shown to be a powerful alternative to beam search decoding in a variety of text generation tasks. MBR decoding selects a hypothesis from a pool of hypotheses that has the least expected risk under…

Artificial Intelligence · Computer Science 2024-06-13 Yuu Jinnai , Tetsuro Morimura , Ukyo Honda , Kaito Ariu , Kenshi Abe

E-commerce search engines often rely solely on product titles as input for ranking models with latency constraints. However, this approach can result in suboptimal relevance predictions, as product titles often lack sufficient detail to…

Information Retrieval · Computer Science 2025-08-13 Nitin Yadav , Changsung Kang , Hongwei Shang , Ming Sun

As Large Language Models (LLMs) have become capable of generating long and descriptive code summaries, accurate and reliable evaluation of factual consistency has become a critical challenge. However, previous evaluation methods are…

Computation and Language · Computer Science 2026-04-14 Suyoung Bae , CheolWon Na , Jaehoon Lee , Yumin Lee , YunSeok Choi , Jee-Hyong Lee