The reviewed record of science sign in
Pith

arxiv: 2210.08808 · v1 · pith:A6DV5JIK · submitted 2022-10-17 · cs.CL

Towards Robust k-Nearest-Neighbor Machine Translation

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:A6DV5JIKrecord.jsonopen to challenge →

classification cs.CL
keywords modelknn-mtpairsrobustimportantk-nearest-neighbormachineresults
0
0 comments X
read the original abstract

k-Nearest-Neighbor Machine Translation (kNN-MT) becomes an important research direction of NMT in recent years. Its main idea is to retrieve useful key-value pairs from an additional datastore to modify translations without updating the NMT model. However, the underlying retrieved noisy pairs will dramatically deteriorate the model performance. In this paper, we conduct a preliminary study and find that this problem results from not fully exploiting the prediction of the NMT model. To alleviate the impact of noise, we propose a confidence-enhanced kNN-MT model with robust training. Concretely, we introduce the NMT confidence to refine the modeling of two important components of kNN-MT: kNN distribution and the interpolation weight. Meanwhile we inject two types of perturbations into the retrieved pairs for robust training. Experimental results on four benchmark datasets demonstrate that our model not only achieves significant improvements over current kNN-MT models, but also exhibits better robustness. Our code is available at https://github.com/DeepLearnXMU/Robust-knn-mt.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.