Challenge: Maximum a posteriori decoding aims to maximize the estimated posterior probability, but high estimated probability does not always lead to high translation quality.
Approach: They propose a method that seeks hypotheses with the highest expected utility by using quasi-sources as “support hypothese . they propose sMBR decoding which utilizes a reference-free quality estimation metric as the utility function.
Outcome: The proposed approach outperforms QE reranking and the standard MBR decoding.

Similar Papers

Understanding the Properties of Minimum Bayes Risk Decoding in Neural Machine Translation (2021.acl-long)

Copied to clipboard

Challenge: Neural Machine Translation (NMT) currently exhibits biases such as producing translations that are too short and overgenerating frequent words.
Approach: They propose to use minimum bayes risk decoding instead of beam search to investigate the effects of beam decoding on unbiased samples.
Outcome: The proposed method improves on a number of previously reported biases and failure cases of beam search on unbiased samples.
High Quality Rather than High Model Probability: Minimum Bayes Risk Decoding with Neural Metrics (2022.tacl-1)

Copied to clipboard

Challenge: Neural machine translations are ranked below human translations in professional evaluations .
Approach: They apply minimum bayes risk decoding to optimize different metrics of translation quality . they show that model estimates and translation quality only vaguely correlate .
Outcome: The proposed method improves human translations with different models and metric.
Sampling-Based Approximations to Minimum Bayes Risk Decoding for Neural Machine Translation (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods to improve beam search quality are inadequate in many ways . a new approximation to the beam search curse has been proposed .
Approach: They propose an approximation to minimum Bayes risk decoding that would solve the beam search curse.
Outcome: The proposed approximation has no equivalent to the beam search curse.
mbrs: A Library for Minimum Bayes Risk Decoding (2024.emnlp-demo)

Copied to clipboard

Challenge: Minimum Bayes risk (MBRS) decoding is a decision rule of text generation tasks that outperforms conventional maximum a posteriori (MAP) decoders by selecting high-quality outputs based on quality or preference rather than probability.
Approach: They propose to use minimum bayes risk (MBRS) decoding to determine outputs based on quality rather than probability.
Outcome: MBRS is an MIT-licensed open-source project with a focus on speed, reproducibility, and extensibility.
Theoretical Guarantees for Minimum Bayes Risk Decoding (2025.acl-long)

Copied to clipboard

Challenge: Minimum Bayes Risk (MBR) decoding is a decision rule used to generate sequences from autoregressive probability models (e.g., LLMs).
Approach: They propose to use minimum bayes risk (MBR) decoding to optimize output selection by maximizing expected utility value of an underlying human distribution.
Outcome: The proposed method is effective even though the language space Y is larger than the hypothesis set.
Case-Based Decision-Theoretic Decoding with Quality Memories (2025.emnlp-main)

Copied to clipboard

Challenge: Minimum Bayes risk (MBR) decoding is a decision rule of text generation . however, it depends on sample texts drawn from the text generation model .
Approach: They propose a case-based decision-theoretic method to estimate the expected utility using examples of domain data.
Outcome: The proposed method outperforms MAP decoding in translation tasks and image captioning tasks on MSCOCO and nocaps datasets.
Epsilon Sampling Rocks: Investigating Sampling Strategies for Minimum Bayes Risk Decoding for Machine Translation (2023.findings-emnlp)

Copied to clipboard

Challenge: Recent advances in machine translation (MT) have shown that minimum bayes risk decoding can be a powerful alternative to beam search.
Approach: They propose to use epsilon-sampling to prune away all tokens with a smaller probability mass.
Outcome: The proposed method outperforms beam search decoding and other methods in four languages.
Faster Minimum Bayes Risk Decoding with Confidence-based Pruning (2023.emnlp-main)

Copied to clipboard

Challenge: Minimum Bayes risk (MBR) decoding is a decision rule for conditional sequence generation tasks.
Approach: They propose an algorithm which grows the number of samples used to estimate utility . it prunes hypotheses that are unlikely to have the highest utility based on bootstrap sampling .
Outcome: The proposed method outperforms beam search in conditional language generation and neural machine translation tasks while being statistically indistinguishable from other proposed methods.
Centroid-Based Efficient Minimum Bayes Risk Decoding (2024.findings-acl)

Copied to clipboard

Challenge: Minimum Bayes risk (MBR) decoding requires quadratic time since it computes the expected score between a translation hypothesis and all reference translations.
Approach: They propose a centroid-based MBR decoding method that clusters the translations in the feature space and calculates the expected score using the centroids of each cluster.
Outcome: The proposed method outperforms vanilla MBR decoding in translation quality by up to 0.5 COMET in the WMT’22 EnJa, EnDe, EnZh, and WMT'23 Enja translation tasks.
Hyperparameter-Free Approach for Faster Minimum Bayes Risk Decoding (2024.findings-acl)

Copied to clipboard

Challenge: Minimum Bayes-Risk (MBR) decoding is a powerful alternative to beam search for text generation tasks.
Approach: They propose a method that uses a hyperparameter-free method to run MBR decoding efficiently.
Outcome: The proposed method reduces the amount of computation but requires hyperparameter tuning to be effective.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations