Co-regularization Based Semi-supervised Domain Adaptation
Abhishek Kumar, Avishek Saha, Hal Daumé · neural information processing systems · 2010
This paper presents a co-regularization based approach to semi-supervised domain adaptation. Our proposed approach (EA++) builds on the notion of augmented space (introduced in EASYADAPT (EA) [1]) and harnesses unlabeled data in target domain to further assist the transfer of information from source to target. This semi-supervised approach to domain adaptation is extremely simple to implement and can be applied as a pre-processing step to any supervised learner. Our theoretical analysis (in terms of Rademacher complexity) of EA and EA++ show that the hypothesis class of EA++ has lower complexity (compared to EA) and hence results in tighter generalization bounds. Experimental results on sentiment analysis tasks reinforce our theoretical findings and demonstrate the efficacy of the proposed method when compared to EA as well as few other representative baseline approaches.
Cited by 136 works.
Authors
References
- Combining labeled and unlabeled data with co-training
- Domain adaptation with structural correspondence learning
- Biographies, Bollywood, Boom-boxes and Blenders: Domain Adaptation for Sentiment Classification
- Analysis of Representations for Domain Adaptation
- Frustratingly Easy Domain Adaptation
- Regularized multi--task learning
- Learning Bounds for Domain Adaptation
- Transferring naive bayes classifiers for text classification
- Domain adaptation from multiple sources via auxiliary classifiers
- A Co-Regularization Approach to Semi-supervised Learning with Multiple Views