Bridging the Domain Gaps in Context Representations for k-Nearest Neighbor Neural Machine Translation (2023.acl-long)
Copied to clipboard
Zhiwei Cao, Baosong Yang, Huan Lin, Suhang Wu, Xiangpeng Wei, Dayiheng Liu, Jun Xie, Min Zhang, Jinsong Su
| Challenge: | Existing methods to improve k-Nearest neighbor machine translation (kNN-MT) are based on the ability to non-parametrically adapt to new domains. |
| Approach: | They propose a method to boost the datastore retrieval of k-Nearest neighbor machine translation by reconstructing the original datastore. |
| Outcome: | The proposed method boosts the retrieval and translation quality of k-Nearest neighbor machine translation by reconstructing the original datastore. |
Similar Papers
Efficient Cluster-Based k-Nearest-Neighbor Machine Translation (2022.acl-long)
Copied to clipboard
| Challenge: | k-Nearest-Neighbor Machine Translation (kNN-MT) is a non-parametric solution for domain adaptation . previous studies have shown that kNN retrieval is at the expense of high latency . |
| Approach: | They propose to use clustering to improve retrieval efficiency by combining a non-parametric MT with an in-domain feature-based retrieval module. |
| Outcome: | The proposed method reduces translation latency by 57% while maintaining the most useful information of the original datastore. |
Towards Robust k-Nearest-Neighbor Machine Translation (2022.emnlp-main)
Copied to clipboard
| Challenge: | k-Nearest-Neighbor Machine Translation (kNN-MT) is a popular research paradigm in machine translation. |
| Approach: | They propose a confidence-enhanced kNN-MT model with robust training to reduce noise . they introduce NMT confidence to refine the modeling of important components of kN-MT . |
| Outcome: | The proposed model improves on four benchmark datasets and is robust to training. |
Nearest Neighbor Machine Translation is Meta-Optimizer on Output Projection Layer (2023.emnlp-main)
Copied to clipboard
| Challenge: | Nearest Neighbor Machine Translation (kNN-MT) is a powerful domain adaptation tool . the reasons for its success have not been thoroughly investigated . |
| Approach: | They propose to integrate pre-trained Neural Machine Translation models with token-level retrieval . they propose to implicitly execute gradient descent on the output projection layer of NMT . |
| Outcome: | The proposed approach outperforms model fine-tuning on in-domain tests while achieving better performance on out-of-domain sets. |
Learning Decoupled Retrieval Representation for Nearest Neighbour Neural Machine Translation (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods to integrate external corpus are sparse in practical applications, and noises in low similarity retrieval could lead to severe performance degradation. |
| Approach: | They propose a method to integrate external corpus into k-nearest neighbor machine translation (kNNMT) instead of storing discrete word sequence, kNN-MT uses a pre-trained NMT model to force decoding the external corpi. |
| Outcome: | The proposed approach improves retrieval accuracy and BLEU score on five domains compared to vanilla kNNMT. |
Efficient Domain Adaptation for Non-Autoregressive Machine Translation (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing non-parametric approaches like nearest neighbor machine translation have made small Autoregressive translation models less efficient . despite their impressive generalization and task performance, LLMs suffer from prohibitive inference cost when confronted with specific domains. |
| Approach: | They propose a domain adaptation approach that tailors a k-nearest-neighbor algorithm for NAT models that incorporates the parallel nature of NAT. |
| Outcome: | The proposed approach achieves significant improvements over the Base-NAT model and exhibits enhanced efficiency. |
Efficient k-Nearest-Neighbor Machine Translation with Dynamic Retrieval (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing models for non-parametric domain adaptation lack kNN retrieval at each timestep, leading to substantial time overhead. |
| Approach: | They propose a kNN-MT-based model that uses a domain-specific translation knowledge store to interpolate the prediction distribution of the model. |
| Outcome: | The proposed model significantly extends kNN-MT with dynamic retrieval on widely-used datasets. |
Exploiting Target Language Data for Neural Machine Translation Beyond Back Translation (2024.findings-acl)
Copied to clipboard
| Challenge: | Neural Machine Translation (NMT) encounters challenges when translating in new domains and low-resource languages. |
| Approach: | They propose a variant of k-nearest neighbor machine translation that utilizes target language data by constructing a pseudo datastore. |
| Outcome: | The proposed method exhibits strong domain adaptation capability in both high-resource and low-resourced machine translation. |
Non-Parametric Unsupervised Domain Adaptation for Neural Machine Translation (2021.findings-emnlp)
Copied to clipboard
| Challenge: | kNN-MT is a non-parametric method that uses nearest neighbor retrieval to translate out-of-domain sentences, rare words, etc. |
| Approach: | They propose a framework that directly uses in-domain monolingual sentences to build an effective datastore for k-nearest-neighbor retrieval. |
| Outcome: | The proposed framework improves translation accuracy with target-side monolingual data while achieving comparable performance with back-translation. |
Revisiting Source Context in Nearest Neighbor Machine Translation (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing research does not explicitly consider the source context when retrieving similar examples . |
| Approach: | They propose a method to improve neural machine translation via source context enhancement by integrating a source-aware distance calibration module. |
| Outcome: | The proposed approach can be integrated with representative kNN-MT baselines and achieve significant performance improvements. |
Chunk-based Nearest Neighbor Machine Translation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Semi-parametric models augment generation with retrieval, but require expensive retrieval operation for every generated token. |
| Approach: | They propose a semi-parametric model which augments generation with retrieval by retrieving tokens from a datastore. |
| Outcome: | The proposed model can retrieve chunks of tokens from the datastore, instead of a single token, with a low decoding speed. |