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.

Similar Papers

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.
Enhancing Neural Machine Translation Through Target Language Data: A kNN-LM Approach for Domain Adaptation (2025.acl-long)

Copied to clipboard

Challenge: Neural machine translation (NMT) has made significant progress in recent years, yet often suffers from translating in new domains, which is called domain adaptation.
Approach: They propose a method that leverages semantically similar target language sentences in the kNN framework and generates a probability distribution over these sentences during decoding.
Outcome: The proposed method generates a probability distribution over similar target language sentences and then interpolates with the model’s distribution.
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.
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.
A Survey of Domain Adaptation for Neural Machine Translation (C18-1)

Copied to clipboard

Challenge: Neural machine translation (NMT) is a deep learning based approach for machine translation.
Approach: They propose to use a deep learning approach to train machine translation in scenarios where large-scale parallel corpora are available.
Outcome: The proposed approach yields the state-of-the-art translation performance in resource rich scenarios.
Neighbors Are Not Strangers: Improving Non-Autoregressive Translation under Low-Frequency Lexical Constraints (2022.naacl-main)

Copied to clipboard

Challenge: Existing approaches to lexically constrained neural machine translation suffer from high latency.
Approach: They propose a plug-in algorithm for non-autoregressive translation for this problem . they propose ACT to familiarize the model with the source-side context of constraints .
Outcome: The proposed model improves over the backbone constrained NAT model in constraint preservation and translation quality, especially for rare constraints.
Bridging the Domain Gaps in Context Representations for k-Nearest Neighbor Neural Machine Translation (2023.acl-long)

Copied to clipboard

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.
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.
Domain Adaptive Inference for Neural Machine Translation (P19-1)

Copied to clipboard

Challenge: Neural Machine Translation models are effective when trained on broad domains with large datasets, such as news translation.
Approach: They propose a novel approach for adaptive ensemble weighting for Neural Machine Translation by extending Bayesian Interpolation with source information.
Outcome: The proposed approach improves performance on Spanish-English and English-German tasks without the need for the domain label.
Domain Adaptation of Neural Machine Translation by Lexicon Induction (P19-1)

Copied to clipboard

Challenge: Neural machine translation (NMT) is sensitive to domain shift, resulting in failure for sentences with large numbers of unknown words and lack of supervision for domain-specific words.
Approach: They propose an unsupervised method which fine-tunes a pre-trained out-of-domain NMT model using a pseudo-in-domain corpus.
Outcome: The proposed method improves in five domains without using in-domain parallel sentences and up to 2 BLEU over strong back-translation baselines.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations