Challenge: Despite advances in computer vision, its application on language input still needs to be explored despite its feasibility.
Approach: They propose a universal domain adaptation (uniDA) benchmark for natural language that offers thorough viewpoints of the model’s generalizability and robustness.
Outcome: The proposed model can handle spoken language in the real world while also detecting unprocessable inputs from the target domain.

Similar Papers

Neural Unsupervised Domain Adaptation in NLP—A Survey (2020.coling-main)

Copied to clipboard

Challenge: Deep neural networks excel at learning from labeled data, but learning from unlabeled data remains a challenge.
Approach: They review neural unsupervised domain adaptation techniques which do not require labeled target domain data.
Outcome: The proposed techniques are more challenging yet widely applicable.
Out-of-Distribution Generalization in Natural Language Processing: Past, Present, and Future (2023.emnlp-main)

Copied to clipboard

Challenge: Existing literature on the generalization of machine learning models to out-of-distribution data is lacking.
Approach: They propose to present the first comprehensive review of recent progress, methods, and evaluations on the generalization challenge from an OOD perspective in natural language understanding.
Outcome: The proposed survey provides the first comprehensive review of recent progress, methods, and evaluations on the generalization challenge from an OOD perspective in natural language understanding.
UDAPTER - Efficient Domain Adaptation Using Adapters (2023.eacl-main)

Copied to clipboard

Challenge: Using adapters, unsupervised domain adaptation (UDA) is more parameter efficient and requires large-scale data to be effective.
Approach: They propose to add small bottleneck layers to each layer of a pre-trained language model to make it more parameter efficient by adding adapters.
Outcome: The proposed methods outperform unsupervised domain adaptation methods such as DANN and DSN in natural language inference and sentiment classification tasks.
Improving Both Domain Robustness and Domain Adaptability in Machine Translation (2022.coling-1)

Copied to clipboard

Challenge: Existing approaches to domain adaptation for NMT depend on high-quality parallel data.
Approach: They propose a meta-learning framework which improves domain robustness and adaptability . they use a word-level domain mixing model and a domain classifier to integrate it .
Outcome: The proposed approach improves domain robustness and adaptability in seen and unseen domains.
Towards Robust Universal Information Extraction: Dataset, Evaluation, and Solution (2025.acl-long)

Copied to clipboard

Challenge: Existing robust benchmark datasets generate only a limited range of perturbations for a single Information Extraction (UIE) task, which fails to evaluate the robustness of UIE models effectively.
Approach: They propose a new benchmark dataset that utilizes Large Language Models to generate more diverse and realistic perturbations across different IE tasks.
Outcome: The proposed model performs better with only 15% of the data and is more robust with other models.
Generative Data Augmentation using LLMs improves Distributional Robustness in Question Answering (2024.eacl-srw)

Copied to clipboard

Challenge: Existing domain adaptation methods do not account for unseen natural distribution shifts.
Approach: They perform experiments on 4 different datasets under varying amounts of distribution shift . they analyze how "in-the-wild" generation can help achieve domain generalization .
Outcome: The proposed approach augments reading comprehension datasets with generated data to improve robustness towards natural distribution shifts.
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.
Source-free Domain Adaptation for Aspect-based Sentiment Analysis (2024.lrec-main)

Copied to clipboard

Challenge: Unsupervised Domain Adaptation (UDA) of the Aspect-based Sentiment Analysis task is a data mining technique that involves aspect extraction and aspect sentiment classification subtasks.
Approach: They propose a framework that allows model parameter transfer, not data transfer, between different domains.
Outcome: The proposed framework performs competitively with traditional unsupervised domain adaptation methods under privacy conditions.
DADA: Distribution-Aware Domain Adaptation of PLMs for Information Retrieval (2024.findings-acl)

Copied to clipboard

Challenge: Pre-trained language models struggle with out-of-domain data due to distribution shifts . generative domain adaptation (DA) methods have been proposed to address these issues .
Approach: They propose a distribution-aware domain adaptation method to address distribution shifts in domains . they use observation-level feedback and observation- level feedback to adapt to the target domain .
Outcome: The proposed method adapts to the domain distribution knowledge at the level of a single document and the corpus and expands document representation to unseen gold query terms using domain and observation feedback.
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.

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