On the True Distribution Approximation of Minimum Bayes-Risk Decoding

Atsumoto Ohashi, Ukyo Honda, Tetsuro Morimura, Yuu Jinnai
3/31/2024
cs.CLcs.AI

No official code found. Best implementation: CyberAgentAILab/mbr-anomaly (4 stars, MIT, last commit 2024-04-02).

Abstract

Minimum Bayes-risk (MBR) decoding has recently gained renewed attention in text generation. MBR decoding considers texts sampled from a model as pseudo-references and selects the text with the highest similarity to the others. Therefore, sampling is one of the key elements of MBR decoding, and previous studies reported that the performance varies by sampling methods. From a theoretical standpoint, this performance variation is likely tied to how closely the samples approximate the true distribution of references. However, this approximation has not been the subject of in-depth study. In this study, we propose using anomaly detection to measure the degree of approximation. We first closely examine the performance variation and then show that previous hypotheses about samples do not correlate well with the variation, but our introduced anomaly scores do. The results are the first to empirically support the link between the performance and the core assumption of MBR decoding.

View on arXivView PDF

Code Implementations(1)

MIT

Code for "On the True Distribution Approximation of Minimum Bayes-Risk Decoding," NAACL 2024

40C, C++Mar 27, 20242 years agoMIT

Similar Papers

Cite this paper

@article{ohashi2024true,
  title  = {On the True Distribution Approximation of Minimum Bayes-Risk Decoding},
  author = {Atsumoto Ohashi and Ukyo Honda and Tetsuro Morimura and Yuu Jinnai},
  year   = {2024},
  eprint = {2404.00752},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.00752v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.00752.svg)](https://codeofpaper.com/paper/2404.00752)

Discussion