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. |
Similar Papers
Adaptive Nearest Neighbor Machine Translation (2021.acl-short)
Copied to clipboard
| Challenge: | kNN-MT uses pre-trained NMT model with token-level k-nearest-neighbor retrieval to improve translation accuracy. |
| Approach: | They propose a method that combines a pre-trained NMT model with token-level k-nearest-neighbor retrieval to improve translation accuracy. |
| Outcome: | The proposed method outperforms the existing model on four benchmark datasets and is open-source. |
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. |
Fast Nearest Neighbor Machine Translation (2022.findings-acl)
Copied to clipboard
| Challenge: | Fast kNN-MT uses the entire corpus as the datastore for the nearest neighbor search . knn-MT is two-orders slower than vanilla MT models . |
| Approach: | They propose a fast kNN-MT model that uses the entire corpus as the datastore for nearest neighbor search. |
| Outcome: | The proposed model is two-orders faster than kNN-MT and is only two times slower than the standard model. |
Revisiting Context Choices for Context-aware Machine Translation (2024.lrec-main)
Copied to clipboard
| Challenge: | Recent work has cast doubt on whether context-aware machine translation models learn useful signals from context or are improvements in automatic evaluation metrics just a side-effect. |
| Approach: | They propose to use separate encoders for source sentence and context as multiple sources for one target sentence to train context-aware machine translation models. |
| Outcome: | The proposed model improves translation quality even with empty lines as context, but the correct context improves it and random out-of-domain context degrades it. |
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. |
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. |
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. |
Nearest Neighbor Knowledge Distillation for Neural Machine Translation (2022.naacl-main)
Copied to clipboard
| Challenge: | k-nearest-neighbor machine translation (kNN-MT) is a state-of-the-art machine translation technique . however, it requires conducting kNN searches for each decoding step, which increases the cost of decoding . |
| Approach: | They propose to move the time-consuming kNN search forward to the preprocessing phase and introduce k Nearest Neighbor Knowledge Distillation (kNN-KD) that trains the base NMT model to directly learn the knowledge of kN. |
| Outcome: | The proposed method improves over the state-of-the-art model while maintaining the same training and decoding speed as the standard model. |
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. |
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. |