Source-Free Progressive Graph Learning for Open-Set Domain Adaptation
Yadan Luo, Zijian Wang, Zhuoxiao Chen, Zi Huang, Mahsa, Baktashmotlagh

TL;DR
This paper introduces a source-free progressive graph learning framework for open-set domain adaptation, addressing theoretical analysis, data coexistence, and uncertainty estimation issues, with improved calibration and performance.
Contribution
It proposes a novel source-free progressive graph learning approach with balanced pseudo-labeling for open-set domain adaptation, overcoming key limitations of existing methods.
Findings
Effective in unsupervised and semi-supervised settings
Improves model calibration and reduces over/under-confidence
Achieves state-of-the-art results on benchmark datasets
Abstract
Open-set domain adaptation (OSDA) has gained considerable attention in many visual recognition tasks. However, most existing OSDA approaches are limited due to three main reasons, including: (1) the lack of essential theoretical analysis of generalization bound, (2) the reliance on the coexistence of source and target data during adaptation, and (3) failing to accurately estimate the uncertainty of model predictions. We propose a Progressive Graph Learning (PGL) framework that decomposes the target hypothesis space into the shared and unknown subspaces, and then progressively pseudo-labels the most confident known samples from the target domain for hypothesis adaptation. Moreover, we tackle a more realistic source-free open-set domain adaptation (SF-OSDA) setting that makes no assumption about the coexistence of source and target domains, and introduce a balanced pseudo-labeling (BP-L)…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning
