Analysis of Representations for Domain Adaptation

Citations Over TimeTop 1% of 2007 papers

Abstract

Discriminative learning methods for classification perform well when training and test data are drawn from the same distribution. In many situations, though, we have labeled training data for a source domain, and we wish to learn a classifier which performs well on a target domain with a different distribution. Under what conditions can we adapt a classifier trained on the source domain for use in the target domain? Intuitively, a good feature representation is a crucial factor in the success of domain adaptation. We formalize this intuition theoretically with a generalization bound for domain adaption. Our theory illustrates the tradeoffs inherent in designing a representation for domain adaptation and gives a new justification for a recently proposed model. It also points toward a promising new model for domain adaptation: one which explicitly minimizes the difference between the source and target domains, while at the same time maximizing the margin of the training set.

Related Papers

• → WUT at SemEval-2019 Task 9: Domain-Adversarial Neural Networks for Domain Adaptation in Suggestion Mining(2019)4 cited
• → Data Centric Domain Adaptation for Historical
\nText with OCR Errors(2021)3 cited
• → Learning under Unknown Bias(2013)
• → MADI: Inter-domain Matching and Intra-domain Discrimination for Cross-domain Speech Recognition(2023)
• → DASA: Domain Adaptation via Saliency Augmentation(2023)