mlsanityData to 7 Oct 2026

What Knowledge Is Needed? Towards Explainable Memory for kNN-MT Domain Adaptation

arXiv 2211.04052 ↗First posted 8 Nov 2022cs.CLcited by 7

Not on the map. Why?

Abstract (arXiv)

kNN-MT presents a new paradigm for domain adaptation by building an external datastore, which usually saves all target language token occurrences in the parallel corpus. As a result, the constructed datastore is usually large and possibly redundant. In this paper, we investigate the interpretability issue of this approach: what knowledge does the NMT model need? We propose the notion of local correctness (LAC) as a new angle, which describes the potential translation correctness for a single entry and for a given neighborhood. Empirical study shows that our investigation successfully finds the conditions where the NMT model could easily fail and need related knowledge. Experiments on six diverse target domains and two language-pairs show that pruning according to local correctness brings a light and more explainable memory for kNN-MT domain adaptation.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 13 of its 25 references that are in the map. First posted on arXiv 8 Nov 2022.

Builds on

13 of 25 references.

References · 13

  1. 2017Attention Is All You Needcited by 59,932
  2. 2017Billion-scale similarity search with GPUscited by 2,477
  3. 2018Deep contextualized word representationscited by 2,285
  4. 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,486
  5. 2020COMET: A Neural Framework for MT Evaluationcited by 1,024
  6. 2020Nearest Neighbor Machine Translationcited by 209
  7. 2019Facebook FAIR's WMT19 News Translation Task Submissioncited by 179
  8. 2020Unsupervised Domain Clusters in Pretrained Language Modelscited by 160
  9. 2021Adaptive Nearest Neighbor Machine Translationcited by 58
  10. 2019Domain Adaptation of Neural Machine Translation by Lexicon Inductioncited by 33
  11. 2021Learning Kernel-Smoothed Machine Translation with Retrieved Examplescited by 25
  12. 2022Efficient Cluster-Based k-Nearest-Neighbor Machine Translationcited by 24
1 more
  1. 2022Efficient Machine Translation Domain Adaptationcited by 7

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 2; 2025: 2.

7 papers.