Centroid-Based Efficient Minimum Bayes Risk Decoding

Hiroyuki Deguchi, Yusuke Sakai, Hidetaka Kamigaito, Taro Watanabe, Hideki Tanaka +1 more
2/17/2024
cs.CL

No official code found. Best implementation: naist-nlp/mbrs (53 stars, MIT, PyTorch, last commit 2025-11-02).

Abstract

Minimum Bayes risk (MBR) decoding achieved state-of-the-art translation performance by using COMET, a neural metric that has a high correlation with human evaluation. However, MBR decoding requires quadratic time since it computes the expected score between a translation hypothesis and all reference translations. We propose centroid-based MBR (CBMBR) decoding to improve the speed of MBR decoding. Our method clusters the reference translations in the feature space, and then calculates the score using the centroids of each cluster. The experimental results show that our CBMBR not only improved the decoding speed of the expected score calculation 5.7 times, but also outperformed vanilla MBR decoding in translation quality by up to 0.5 COMET in the WMT'22 En$\leftrightarrow$Ja, En$\leftrightarrow$De, En$\leftrightarrow$Zh, and WMT'23 En$\leftrightarrow$Ja translation tasks.

View on arXivView PDF

Code Implementations(1)

naist-nlp/mbrsCommunity100%
PyTorchMIT

A library for minimum Bayes risk (MBR) decoding

537PythonApr 24, 202411 months agoMIT
mbr-decodingnatural-language-processingpythonpytorch

Similar Papers

Cite this paper

@article{deguchi2024centroidbased,
  title  = {Centroid-Based Efficient Minimum Bayes Risk Decoding},
  author = {Hiroyuki Deguchi and Yusuke Sakai and Hidetaka Kamigaito and Taro Watanabe and Hideki Tanaka and Masao Utiyama},
  year   = {2024},
  eprint = {2402.11197},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.11197v2}
}

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/2402.11197.svg)](https://codeofpaper.com/paper/2402.11197)

Discussion