Case-Based Decision-Theoretic Decoding with Quality Memories
- URL: http://arxiv.org/abs/2509.12677v1
- Date: Tue, 16 Sep 2025 05:01:05 GMT
- Title: Case-Based Decision-Theoretic Decoding with Quality Memories
- Authors: Hiroyuki Deguchi, Masaaki Nagata,
- Abstract summary: Minimum Bayes risk (MBR) decoding is a decision rule of text generation.<n>It depends on sample texts drawn from the text generation model.<n>It is difficult to find a hypothesis that correctly captures the knowledge or information of out-of-domain.
- Score: 9.995028045771862
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Minimum Bayes risk (MBR) decoding is a decision rule of text generation, which selects the hypothesis that maximizes the expected utility and robustly generates higher-quality texts than maximum a posteriori (MAP) decoding. However, it depends on sample texts drawn from the text generation model; thus, it is difficult to find a hypothesis that correctly captures the knowledge or information of out-of-domain. To tackle this issue, we propose case-based decision-theoretic (CBDT) decoding, another method to estimate the expected utility using examples of domain data. CBDT decoding not only generates higher-quality texts than MAP decoding, but also the combination of MBR and CBDT decoding outperformed MBR decoding in seven domain De--En and Ja$\leftrightarrow$En translation tasks and image captioning tasks on MSCOCO and nocaps datasets.
Related papers
- Minimum Bayes Risk Decoding for Error Span Detection in Reference-Free Automatic Machine Translation Evaluation [50.83502171176548]
State-of-the-art generative ESD methods typically decode using Maximum a Posteriori (MAP)<n>We address this issue by applying Minimum Bayes Risk (MBR) decoding to generative ESD models.
arXiv Detail & Related papers (2025-12-08T13:21:44Z) - Agreement-Constrained Probabilistic Minimum Bayes Risk Decoding [51.82883249233765]
We propose agreement-constrained PMBR decoding, which leverages a knowledge distilled model to guide the completion of the score matrix.<n>Our AC-PMBR decoding improved approximation errors of matrix completion by up to 3 times and achieved higher translation quality compared with PMBR decoding.
arXiv Detail & Related papers (2025-12-01T06:16:47Z) - Re-evaluating Minimum Bayes Risk Decoding for Automatic Speech Recognition [16.295305195753723]
Minimum Bayes Risk (MBR) decoding is effective in text-to-text generation tasks.<n> beam search is the current practice for speech-to-text tasks such as automatic speech recognition (ASR) and Speech Translation (ST)
arXiv Detail & Related papers (2025-10-22T11:06:20Z) - Document-Level Text Generation with Minimum Bayes Risk Decoding using Optimal Transport [3.48097307252416]
We investigate the adaption of Minimum Bayes Risk (MBR) decoding for document-level text generation tasks.<n>MBR decoding makes use of a utility function to estimate the output with the highest expected utility from a set of candidate outputs.<n>MBR-OT, a variant of MBR decoding using Wasserstein distance, computes the utility of a document using a sentence-level utility function.
arXiv Detail & Related papers (2025-05-29T04:34:04Z) - BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms [101.9736063064503]
Speculative decoding has emerged as a popular method to accelerate the inference of Large Language Models (LLMs)<n>This paper proposes a training-free online learning framework to adaptively choose the configuration of the hyper parameters for speculative decoding as text is being generated.
arXiv Detail & Related papers (2025-05-21T05:56:31Z) - mbrs: A Library for Minimum Bayes Risk Decoding [27.207891251898904]
mbrs is a library of Minimum Bayes risk (MBR) decoding.
MBR is a decision rule of text generation tasks that outperforms conventional maximum a posterior (MAP) decoding.
We published our mbrs as an MIT-licensed open-source project, and the code is available on GitHub.
arXiv Detail & Related papers (2024-08-08T02:28:32Z) - Unveiling the Power of Source: Source-based Minimum Bayes Risk Decoding for Neural Machine Translation [30.323103270892734]
Minimum Bayes Risk (MBR) decoding offers an alternative by seeking hypotheses with the highest expected utility.<n>Our findings suggest that sMBR is a promising approach for NMT decoding.
arXiv Detail & Related papers (2024-06-17T15:13:52Z) - Linear-time Minimum Bayes Risk Decoding with Reference Aggregation [52.1701152610258]
Minimum Bayes Risk (MBR) decoding is a text generation technique that has been shown to improve the quality of machine translations.
It requires the pairwise calculation of a utility metric, which has quadratic complexity.
We propose to approximate pairwise metric scores with scores calculated against aggregated reference representations.
arXiv Detail & Related papers (2024-02-06T18:59:30Z) - Generating Diverse and High-Quality Texts by Minimum Bayes Risk Decoding [4.209844101827474]
We develop diversity-promoting decoding algorithms by enforcing diversity objectives to Minimum Bayes-Risk decoding.
We evaluate DMBR and KMBR on a variety of directed text generation tasks using encoder-decoder models and a large language model with prompting.
arXiv Detail & Related papers (2024-01-10T10:23:41Z) - Quality-Aware Translation Models: Efficient Generation and Quality Estimation in a Single Model [77.19693792957614]
We propose to make neural machine translation (NMT) models quality-aware by training them to estimate the quality of their own output.
We obtain quality gains similar or even superior to quality reranking approaches, but with the efficiency of single pass decoding.
arXiv Detail & Related papers (2023-10-10T15:33:51Z) - Contrastive Decoding: Open-ended Text Generation as Optimization [153.35961722855686]
We propose contrastive decoding (CD), a reliable decoding approach.
It is inspired by the fact that the failures of larger LMs are even more prevalent in smaller LMs.
CD requires zero additional training, and produces higher quality text than decoding from the larger LM alone.
arXiv Detail & Related papers (2022-10-27T00:58:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.