Towards Unsupervised Open-Set Graph Domain Adaptation via Dual Reprogramming
Zhen Zhang, Bingsheng He

TL;DR
This paper introduces GraphRTA, a novel unsupervised open-set graph domain adaptation framework that reprograms both the graph structure and the model to effectively classify known nodes and identify unseen classes.
Contribution
The paper proposes a dual reprogramming approach for open-set graph domain adaptation, extending existing methods to recognize unseen classes without manual threshold tuning.
Findings
Achieves competitive performance on public datasets.
Effectively separates known and unknown classes.
Reduces bias towards source domain through model pruning.
Abstract
Unsupervised Graph Domain Adaptation has become a promising paradigm for transferring knowledge from a fully labeled source graph to an unlabeled target graph. Existing graph domain adaptation models primarily focus on the closed-set setting, where the source and target domains share the same label spaces. However, this assumption might not be practical in the real-world scenarios, as the target domain might include classes that are not present in the source domain. In this paper, we investigate the problem of unsupervised open-set graph domain adaptation, where the goal is to not only correctly classify target nodes into the known classes, but also recognize previously unseen node types into the unknown class. Towards this end, we propose a novel framework called GraphRTA, which conducts reprogramming on both the graph and model sides. Specifically, we reprogram the graph by modifying…
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
TopicsAdvanced Graph Neural Networks · Domain Adaptation and Few-Shot Learning · Multimodal Machine Learning Applications
