Meta-Reweighted Regularization for Unsupervised Domain Adaptation

• Published in: IEEE transactions on knowledge and data engineering Vol. 35; no. 3; pp. 2781 - 2795
• Main Authors: Li, Shuang, Ma, Wenxuan, Zhang, Jinming, Liu, Chi Harold, Liang, Jian, Wang, Guoren
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.03.2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Adaptation; Adaptation models; Adaptive sampling; adversarial learning; Adversarial machine learning; Algorithms; Classification; Classifiers; Data models; Domain adaptation; Domains; Knowledge management; Labels; Machine learning; meta learning; Noise measurement; Optimization; Predictive models; Regularization; sample reweighting; self training; Task analysis; Training
• ISSN: 1041-4347; 1558-2191
• DOI: 10.1109/TKDE.2021.3114536

Unsupervised domain adaptation (UDA) enables knowledge transfer from a labeled source domain to an unlabeled target domain by reducing the cross-domain distribution discrepancy, and the adversarial learning based paradigm has achieved remarkable success. On top of the derived domain-invariant feature representations, a promising stream of recent works seeks to further regularize the classification decision boundary via self-training to learn target adaptive classifier with pseudo-labeled target samples. However, since the pseudo labels are inevitably noisy, most of prior methods focus on manually designing elaborate target selection algorithms or optimization objectives to combat the negative effect caused by the incorrect pseudo labels. Different from them, in this paper, we propose a simple and powerful meta-learning based target-reweighting regularization algorithm, called MetaReg, which regularizes the model training by learning to reweight the noisy pseudo-labeled target samples. Specifically, MetaReg is motivated by the intuition that an ideal target classifier trained on correct target pseudo labels should make small classification errors on target-like source samples. Therefore, we explicitly define a meta reweighting problem that aims to find the optimal weights for different target pseudo labels by minimizing the classification loss on a designed validation set, a class-balanced set consisting of source samples that are most similar to target ones. Note that the optimization problem can be solved efficiently with a simplified approximation technique. As a result, the automatically learned optimal weights are utilized to reweight pseudo-labeled target samples, and regularize the model learning by target supervision with the learned different importance. Comprehensive experiments on several cross-domain image and text datasets verify that MetaReg could outperform the non-regularized UDA counterparts with state-of-the-art performance. Code is available at https://github.com/BIT-DA/MetaReg .