Exploring Category-Agnostic Clusters for Open-Set Domain Adaptation
Yingwei Pan, Ting Yao, Yehao Li, Chong-Wah Ngo, Tao Mei
Abstract
Unsupervised domain adaptation has received significant attention in recent years. Most of existing works tackle the closed-set scenario, assuming that the source and target domains share the exactly same categories. In practice, nevertheless, a target domain often contains samples of classes unseen in source domain (i.e., unknown class). The extension of domain adaptation from closedset to such open-set situation is not trivial since the target samples in unknown class are not expected to align with the source. In this paper, we address this problem by augmenting the state-of-the-art domain adaptation technique, Self-Ensembling, with category-agnostic clusters in target domain. Specifically, we present Self-Ensembling with Category-agnostic Clusters (SE-CC) -a novel architecture that steers domain adaptation with the additional guidance of category-agnostic clusters that are specific to target domain. These clustering information provides domain-specific visual cues, facilitating the generalization of Self-Ensembling for both closed-set and open-set scenarios. Technically, clustering is firstly performed over all the unlabeled target samples to obtain the categoryagnostic clusters, which reveal the underlying data space structure peculiar to target domain. A clustering branch is capitalized on to ensure that the learnt representation preserves such underlying structure by matching the estimated assignment distribution over clusters to the inherent cluster distribution for each target sample. Furthermore, SE-CC enhances the learnt representation with mutual information maximization. Extensive experiments are conducted on Office and VisDA datasets for both open-set and closed-set domain adaptation, and superior results are reported when comparing to the state-of-the-art approaches.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3856ac44-8d84-4837-b328-08d2da89635aCited by top-tier papers14
- Exploiting the Intrinsic Neighborhood Structure for Source-free Domain AdaptationShiqi Yang, Yaxing Wang, Joost van de Weijer, Luis Herranz et al.NeurIPS 2021 · 371 citations
- Exploring Domain-Invariant Parameters for Source Free Domain AdaptationFan Wang, Zhongyi Han, Yongshun Gong, Yilong YinCVPR 2022 · 90 citations
- Dual Bipartite Graph Learning: A General Approach for Domain Adaptive Object DetectionChaoqi Chen, Jiongcheng Li, Zebiao Zheng, Yue Huang et al.ICCV 2021 · 65 citations
- Parametric Information Maximization for Generalized Category DiscoveryFlorent Chiaroni, Jose Dolz, Imtiaz Masud Ziko, Amar Mitiche et al.ICCV 2023 · 52 citations
- A Style and Semantic Memory Mechanism for Domain Generalization*Yang Chen, Yu Wang, Yingwei Pan, Ting Yao et al.ICCV 2021 · 47 citations
Related papers
- Attract or Distract: Exploit the Margin of Open SetQianyu Feng, Guoliang Kang, Hehe Fan, Yi YangICCV 2019 · 62 citations
- Self-Labeling Framework for Novel Category Discovery over DomainsQing Yu, Daiki Ikami, Go Irie, Kiyoharu AizawaAAAI 2022 · 33 citations
- Dynamic Target Distribution Estimation for Source-Free Open-Set Domain AdaptationZhiqi Yu, Zhichao Liao, Jingjing Li, Zhi Chen et al.AAAI 2025 · 5 citations
- Upcycling Models Under Domain and Category ShiftSanqing Qu, Tianpei Zou, Florian Röhrbein, Cewu Lu et al.CVPR 2023
- Unknown-Aware Domain Adversarial Learning for Open-Set Domain AdaptationJoonHo Jang, Byeonghu Na, DongHyeok Shin, Mingi Ji et al.NeurIPS 2022 · 85 citations
