Learning Confidence for Transformer-based Neural Machine Translation
Yu Lu, Jiali Zeng, Jiajun Zhang, Shuangzhi Wu, Mu Li

TL;DR
This paper introduces an unsupervised confidence estimation method for neural machine translation that assesses prediction reliability by counting hints needed, improving quality estimation and out-of-domain detection.
Contribution
It proposes a novel confidence learning approach integrated with NMT training, enabling accurate confidence assessment without supervision.
Findings
High accuracy in sentence and word-level quality estimation.
Effective detection of noisy samples and out-of-domain data.
Improved label smoothing using confidence estimates.
Abstract
Confidence estimation aims to quantify the confidence of the model prediction, providing an expectation of success. A well-calibrated confidence estimate enables accurate failure prediction and proper risk measurement when given noisy samples and out-of-distribution data in real-world settings. However, this task remains a severe challenge for neural machine translation (NMT), where probabilities from softmax distribution fail to describe when the model is probably mistaken. To address this problem, we propose an unsupervised confidence estimate learning jointly with the training of the NMT model. We explain confidence as how many hints the NMT model needs to make a correct prediction, and more hints indicate low confidence. Specifically, the NMT model is given the option to ask for hints to improve translation accuracy at the cost of some slight penalty. Then, we approximate their…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Topic Modeling · Machine Learning and Data Classification
MethodsSoftmax · Label Smoothing
