Papers with UDA

15 papers
Unsupervised Reinforcement Adaptation for Class-Imbalanced Text Classification (2022.starsem-1)

Copied to clipboard

Challenge: Existing models for class imbalanced labels learn domain-invariant representations across domains and evaluate primarily on class-balanced data.
Approach: They propose an unsupervised domain adaptation approach that leverages feature variants and imbalanced labels across domains to learn robust representations.
Outcome: The proposed method can learn robust domain-invariant representations and adapt classifiers on imbalanced classes over domains.
Simplified Neural Unsupervised Domain Adaptation (N19-1)

Copied to clipboard

Challenge: Existing unsupervised domain adaptation methods use neural networks to learn representations that are trained to predict the values of subset of important features called “pivot features.”
Approach: They propose to combine the representation learner and task learner to improve on existing neural domain adaptation algorithms by removing heuristically-selected "pivot features" they show competitive performance with a simpler model.
Outcome: The proposed model outperforms existing models by removing heuristically-selected pivot features.
Multi-Source Attention for Unsupervised Domain Adaptation (2020.aacl-main)

Copied to clipboard

Challenge: Existing approaches for domain adaptation (UDA) focus on adapting to a domain from a single source domain, but labelled instances are not available for the target domain.
Approach: They propose to model source-selection in unsupervised domain adaptation as an attention-learning problem, where attention is learned over the sources per given target instance.
Outcome: The proposed method outperforms previous proposed methods on two cross-domain sentiment classification datasets and is able to explain the predictions.
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.
UDALM: Unsupervised Domain Adaptation through Language Modeling (2021.naacl-main)

Copied to clipboard

Challenge: Existing techniques for unsupervised domain adaptation (UDA) are limited by domain shift, which leads to performance degradation.
Approach: They propose a fine-tuning procedure that uses a mixed classification and Masked Language Model loss to adapt to the target domain distribution in a robust and sample efficient manner.
Outcome: The proposed procedure can adapt to the target domain distribution in a robust and sample efficient manner.
Domain Confused Contrastive Learning for Unsupervised Domain Adaptation (2022.naacl-main)

Copied to clipboard

Challenge: Existing studies on domain-shifting adaptations have focused on domain .
Approach: They propose a self-supervised approach to unsupervised domain adduction using domain puzzles to bridge the source and target domains and retain discriminative representations after adaptation.
Outcome: The proposed approach outperforms baselines and further ablation studies show that it is more stable and effective when performing other data augmentations.
Semi-Supervised Domain Adaptation for Emotion-Related Tasks (2023.findings-acl)

Copied to clipboard

Challenge: Semi-supervised domain adaptation (SSDA) is a model trained from a label-rich source domain to a new but related domain with a few labels of target data.
Approach: They propose to decompose the semi-supervised domain adaptation framework into two subcomponents of unsupervised domain adaption (UDA) from the source to the target domain and semi-supervised learning (SSL) in the target.
Outcome: The proposed method is based on the co-learning of multiple classifiers for computer vision tasks and is published in the journal Nature.
Adapt in Contexts: Retrieval-Augmented Domain Adaptation via In-Context Learning (2023.emnlp-main)

Copied to clipboard

Challenge: Large language models have demonstrated their capability with few-shot inference . however, in-domain demonstrations are not always available in real scenarios .
Approach: They propose unsupervised domain adaptation problem to adapt language models from source domain to target domain without any target labels.
Outcome: The proposed model performs better than baseline models on Sentiment Analysis and Named Entity Recognition tasks.
Unsupervised Data Augmentation with Naive Augmentation and without Unlabeled Data (2021.emnlp-main)

Copied to clipboard

Challenge: Unsupervised Data Augmentation (UDA) is a semisupervised learning method that penalizes differences between a model's predictions on unlabeled examples and corresponding 'noised' examples produced via data augmentation.
Approach: They propose to use a consistency loss to penalize differences between models' predictions on unlabeled and unlabed examples to enforce consistency between models and their perturbed counterparts.
Outcome: The proposed method is able to penalize differences between models' outputs on unlabeled and unlabed examples without complex data augmentation.
Matching Distributions between Model and Data: Cross-domain Knowledge Distillation for Unsupervised Domain Adaptation (2021.acl-long)

Copied to clipboard

Challenge: Existing methods require to learn to adapt the target model by exploiting the source data and sharing the network architecture across domains.
Approach: They propose a framework that allows to transfer the knowledge of source domain to the unlabeled target domain without using source data.
Outcome: The proposed framework matches distributions between a trained source model and a set of target data and achieves superior performance on cross-domain text classification.
Dynamic Regularization in UDA for Transformers in Multimodal Classification (2023.acl-long)

Copied to clipboard

Challenge: Multimodal machine learning is a cutting-edge field that explores ways to combine information from multiple sources into models.
Approach: They propose a multimodal BERT-ViT model that exploits weaker modality while regularizing the loss function.
Outcome: The proposed model exploits weaker modality while regularizing the loss function.
Back-Training excels Self-Training at Unsupervised Domain Adaptation of Question Generation and Passage Retrieval (2021.emnlp-main)

Copied to clipboard

Challenge: Using self-training to train unsupervised domains can be expensive, resulting in poor generalization due to distributional shift.
Approach: They propose to use unaligned data to train unsupervised domain adaptation models using cheap synthetically generated labeled data.
Outcome: The proposed method significantly outperforms self-training on question generation and passage retrieval domains and on MLQuestions and PubMedQA.
Unsupervised Data Augmentation for Aspect Based Sentiment Analysis (2022.coling-1)

Copied to clipboard

Challenge: Recent approaches to Aspect-based Sentiment Analysis (ABSA) perform the subtasks of aspect term extraction (ATE) and aspect sentiment classification (ASC) simultaneously.
Approach: They introduce an adaptation of Unsupervised Data Augmentation in semi-supervised learning that performs both aspects of Aspect-based Sentiment Analysis (ABSA) and aspect sentiment classification (ASC) they show that simple augmentations applied to modest-sized datasets along with consistency training lead to competitive performance with current ABSA state-of-the-art in restaurant and laptop domains .
Outcome: The proposed approach performs well on a span-level classification task with minimal training data.
Feature Adaptation of Pre-Trained Language Models across Languages and Domains with Robust Self-Training (2020.emnlp-main)

Copied to clipboard

Challenge: Adapting pre-trained language models (PrLMs) to new domains has gained much attention . Adaptation of PrLMs to newdomains is important, but requires fine-tuning .
Approach: They propose to use PrLMs to adapt to new domains without fine-tuning . they use class-aware feature self-distillation to learn discriminative features .
Outcome: The proposed model can learn discriminative features from pre-trained language models without fine-tuning.
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.

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