CODA uses consensus-based priors and Bayesian updating to select the best candidate model with far fewer labels than prior active model selection methods, beating them on 18 of 26 benchmark tasks.
Information-Theoretical Learning of Discriminative Clusters for Unsupervised Domain Adaptation
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We study the problem of unsupervised domain adaptation, which aims to adapt classifiers trained on a labeled source domain to an unlabeled target domain. Many existing approaches first learn domain-invariant features and then construct classifiers with them. We propose a novel approach that jointly learn the both. Specifically, while the method identifies a feature space where data in the source and the target domains are similarly distributed, it also learns the feature space discriminatively, optimizing an information-theoretic metric as an proxy to the expected misclassification error on the target domain. We show how this optimization can be effectively carried out with simple gradient-based methods and how hyperparameters can be cross-validated without demanding any labeled data from the target domain. Empirical studies on benchmark tasks of object recognition and sentiment analysis validated our modeling assumptions and demonstrated significant improvement of our method over competing ones in classification accuracies.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Consensus-Driven Active Model Selection
CODA uses consensus-based priors and Bayesian updating to select the best candidate model with far fewer labels than prior active model selection methods, beating them on 18 of 26 benchmark tasks.