Open-Set Heterogeneous Domain Adaptation: Theoretical Analysis and Algorithm
Thai-Hoang Pham, Yuanlong Wang, Changchang Yin, Xueru Zhang, Ping, Zhang

TL;DR
This paper introduces a new open-set heterogeneous domain adaptation scenario, providing a theoretical framework and a novel algorithm that effectively transfers knowledge across heterogeneous data sources while identifying novel classes.
Contribution
It develops a theoretical framework for open-set heterogeneous domain adaptation and proposes the RL-OSHeDA algorithm to handle feature heterogeneity and novel class detection.
Findings
The proposed method outperforms existing approaches on text, image, and clinical datasets.
Theoretical bounds for prediction error in open-set heterogeneous DA are established.
RL-OSHeDA effectively transfers knowledge and detects novel classes in diverse data scenarios.
Abstract
Domain adaptation (DA) tackles the issue of distribution shift by learning a model from a source domain that generalizes to a target domain. However, most existing DA methods are designed for scenarios where the source and target domain data lie within the same feature space, which limits their applicability in real-world situations. Recently, heterogeneous DA (HeDA) methods have been introduced to address the challenges posed by heterogeneous feature space between source and target domains. Despite their successes, current HeDA techniques fall short when there is a mismatch in both feature and label spaces. To address this, this paper explores a new DA scenario called open-set HeDA (OSHeDA). In OSHeDA, the model must not only handle heterogeneity in feature space but also identify samples belonging to novel classes. To tackle this challenge, we first develop a novel theoretical…
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
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning
