Implicit Task-Driven Probability Discrepancy Measure for Unsupervised Domain Adaptation

Probability discrepancy measure is a fundamental construct for numerous machine learning models such as weakly supervised learning and generative modeling. However, most measures overlook the fact that the distributions are not the end-product of learning, but are the basis of downstream predictor. Therefore it is important to warp the probability discrepancy measure towards the end tasks, and we hence propose a new bi-level optimization based approach so that the two distributions are compared not uniformly against the entire hypothesis space, but only with respect to the optimal predictor for the downstream end task. When applied to margin disparity discrepancy and contrastive domain discrepancy, our method significantly improves the performance in unsupervised domain adaptation, and enjoys a much more principled training process.

Authors

• Mao Li College of Computer Science, Sichuan University, China Engineering Research Center of Machine Learning and Industry Inteligence, Ministry of Education of China
• Kaiqi Jiang
• Xinhua Zhang University of Illinois, Chicago

Keywords

No keywords are indexed for this paper.