A Simple Baseline for Beam Search Reranking
Not on the map. Why?
Abstract (arXiv)
Reranking methods in machine translation aim to close the gap between common evaluation metrics (e.g. BLEU) and maximum likelihood learning and decoding algorithms. Prior works address this challenge by training models to rerank beam search candidates according to their predicted BLEU scores, building upon large models pretrained on massive monolingual corpora -- a privilege that was never made available to the baseline translation model. In this work, we examine a simple approach for training rerankers to predict translation candidates' BLEU scores without introducing additional data or parameters. Our approach can be used as a clean baseline, decoupled from external factors, for future research in this area.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 14 references that are in the map. First posted on arXiv 17 Dec 2022.
Builds on
10 of 14 references.
References · 10
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2019The Curious Case of Neural Text Degenerationcited by 2,881
- 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,486
- 2018Hierarchical Neural Story Generationcited by 1,182
- 2020Is MAP Decoding All You Need? The Inadequacy of the Mode in Neural Machine Translationcited by 137
- 2022Quality-Aware Decoding for Neural Machine Translationcited by 49
- 2020Energy-Based Reranking: Improving Neural Machine Translation Using Energy-Based Modelscited by 44
- 2022RMBR: A Regularized Minimum Bayes Risk Reranking Framework for Machine Translationcited by 2
Built on by
Not cited yet.