CLApr 11, 2017

Later-stage Minimum Bayes-Risk Decoding for Neural Machine Translation

arXiv:1704.03169v217 citations
Originality Incremental advance
AI Analysis

This incremental improvement addresses decoding inefficiencies for neural machine translation systems, potentially enhancing translation quality in practical applications.

The paper tackles the problem of beam search degradation in neural machine translation when models are overconfident in suboptimal predictions by proposing later-stage minimum Bayes-risk (MBR) decoding with GPU-accelerated batch computation. The result shows that this approach outperforms simple MBR reranking in translation tasks, particularly with large beam sizes.

For extended periods of time, sequence generation models rely on beam search algorithm to generate output sequence. However, the correctness of beam search degrades when the a model is over-confident about a suboptimal prediction. In this paper, we propose to perform minimum Bayes-risk (MBR) decoding for some extra steps at a later stage. In order to speed up MBR decoding, we compute the Bayes risks on GPU in batch mode. In our experiments, we found that MBR reranking works with a large beam size. Later-stage MBR decoding is shown to outperform simple MBR reranking in machine translation tasks.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes