On the Hardness of Unsupervised Domain Adaptation: Optimal Learners and Information-Theoretic Perspective
Zhiyi Dong, Zixuan Liu, Yongyi Mao

TL;DR
This paper investigates the fundamental difficulty of unsupervised domain adaptation by modeling the problem through an information-theoretic lens, introducing a new measure called PTLU to quantify learning hardness.
Contribution
It introduces a novel information-theoretic framework for analyzing UDA hardness, characterizes the optimal learner, and proposes PTLU as a new difficulty measure.
Findings
PTLU serves as a lower bound for the risk of any learner.
PTLU outperforms existing measures in evaluating UDA difficulty.
The framework provides insights into the intrinsic challenges of UDA under covariate shift.
Abstract
This paper studies the hardness of unsupervised domain adaptation (UDA) under covariate shift. We model the uncertainty that the learner faces by a distribution in the ground-truth triples -- which we call a UDA class -- where is the source -- target distribution pair and is the classifier. We define the performance of a learner as the overall target domain risk, averaged over the randomness of the ground-truth triple. This formulation couples the source distribution, the target distribution and the classifier in the ground truth, and deviates from the classical worst-case analyses, which pessimistically emphasize the impact of hard but rare UDA instances. In this formulation, we precisely characterize the optimal learner. The performance of the optimal learner then allows us to define the learning difficulty for the UDA class and for the observed sample.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Face recognition and analysis · Stochastic Gradient Optimization Techniques
