Distinguish Then Exploit: Source-free Open Set Domain Adaptation via Weight Barcode Estimation and Sparse Label Assignment
Weiming Liu, Jun Dan, Fan Wang, Xinting Liao, Junhao Dong, Hua Yu, Shunjie Dong, Lianyong Qi
Abstract
Nowadays, domain adaptation techniques have been widely investigated for knowledge sharing from labeled source domain to unlabeled target domain. However, target domain may include some data samples that belong to unknown categories in real-world scenarios. Moreover, the target domain cannot access the source data samples due to privacy-preserving restrictions. In this paper, we focus on the source-free open set domain adaptation problem which includes two main challenges, i.e., how to distinguish known and unknown target samples and how to exploit useful source information to provide trustworthy pseudo labels for known target samples. Existing approaches that directly apply conventional domain alignment methods could lead to sample mismatch and misclassification in this scenario. To overcome these issues, we propose a Distinguish Then Exploit model (DTE) with two components, i.e., weight barcode estimation and sparse label assignment. Weight barcode estimation first calculates the marginal probability of target samples via partially unbalanced optimal transport, then quantize barcode results to distinguish unknown target samples. Sparse label assignment utilizes sparse sample-label matching via proximal term to fully exploit useful source information. Our empirically study on several datasets shows that DTE outperforms the state-of-the-art models on tackling the source-free open set domain adaptation problem.
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 65837097-4d19-48a6-a5d1-cafa37c518eaCited by top-tier papers1
Ask how each one uses itBuilds on28
- Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain AdaptationJian Liang, Dapeng Hu, Jiashi FengICML 2020 · 1,624 citations
- Self-labelling via simultaneous clustering and representation learningYuki Markus Asano, Christian Rupprecht, Andrea VedaldiICLR 2020 · 873 citations
- Unbalanced minibatch Optimal Transport; applications to Domain AdaptationKilian Fatras, Thibault Séjourné, Rémi Flamary, Nicolas CourtyICML 2021 · 183 citations
- Progressive Graph Learning for Open-Set Domain AdaptationYadan Luo, Zijian Wang, Zi Huang, Mahsa BaktashmotlaghICML 2020 · 114 citations
- On Unbalanced Optimal Transport: An Analysis of Sinkhorn AlgorithmKhiem Pham, Khang Le, Nhat Ho, Tung Pham et al.ICML 2020 · 104 citations
Related papers
- Dynamic Target Distribution Estimation for Source-Free Open-Set Domain AdaptationZhiqi Yu, Zhichao Liao, Jingjing Li, Zhi Chen et al.AAAI 2025 · 5 citations
- Source-Free Domain Adaptation via Distribution EstimationNing Ding, Yixing Xu, Yehui Tang, Chao Xu et al.CVPR 2022 · 134 citations
- Unveiling the Unknown: Unleashing the Power of Unknown to Known in Open-Set Source-Free Domain AdaptationFuli Wan, Han Zhao, Xu Yang, Cheng DengCVPR 2024 · 5 citations
- Attract or Distract: Exploit the Margin of Open SetQianyu Feng, Guoliang Kang, Hehe Fan, Yi YangICCV 2019 · 62 citations
- Exploring Domain-Invariant Parameters for Source Free Domain AdaptationFan Wang, Zhongyi Han, Yongshun Gong, Yilong YinCVPR 2022 · 90 citations
