Self-Paced Learning for Open-Set Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
Domain adaptation tackles the challenge of generalizing knowledge acquired from a source domain to a target domain with different data distributions. Traditional domain adaptation methods presume that the classes in the source and target domains are identical, which is not always the case in real-world scenarios. Open-set domain adaptation (OSDA) addresses this limitation by allowing previously unseen classes in the target domain. Open-set domain adaptation aims to not only recognize target samples belonging to common classes shared by source and target domains but also perceive unknown class samples. We propose a novel framework based on self-paced learning to distinguish common and unknown class samples precisely, referred to as SPLOS (self-paced learning for open-set). To utilize unlabeled target samples for self-paced learning, we generate pseudo labels and design a cross-domain mixup method tailored for OSDA scenarios. This strategy minimizes the noise from pseudo labels and ensures our model progressively learns common class features of the target domain, beginning with simpler examples and advancing to more complex ones. Furthermore, unlike existing OSDA methods that require manual hyperparameter threshold tuning to separate common and unknown classes, our approach self-tunes a suitable threshold, eliminating the need for empirical tuning during testing. Comprehensive experiments illustrate that our method consistently achieves superior performance on different benchmarks compared with various state-of-the-art methods.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 28 of its 43 references that are in the map. First posted on arXiv 10 Mar 2023.
Builds on
28 of 43 references.
References · 28
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
- 2017Mask R-CNNcited by 7,259
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
- 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
- 2017VisDA: The Visual Domain Adaptation Challengecited by 432
- 2019Adversarial Domain Adaptation with Domain Mixupcited by 250
- 2020Self-paced Contrastive Learning with Hybrid Memory for Domain Adaptive Object Re-IDcited by 212
- 2018Open Set Domain Adaptation by Backpropagationcited by 150
16 more
- 2018CurriculumNet: Weakly Supervised Learning from Large-Scale Web Imagescited by 126
- 2020Self-supervising Fine-grained Region Similarities for Large-scale Image Localizationcited by 110
- 2020Dual Mixup Regularized Learning for Adversarial Domain Adaptationcited by 99
- 2021OVANet: One-vs-All Network for Universal Domain Adaptationcited by 92
- 2019Learning to Transfer Examples for Partial Domain Adaptationcited by 86
- 2020On the Effectiveness of Image Rotation for Open Set Domain Adaptationcited by 72
- 2022Reusing the Task-specific Classifier as a Discriminator: Discriminator-free Adversarial Domain Adaptationcited by 66
- 2022Transferability in Deep Learning: A Surveycited by 57
- 2020Progressive Graph Learning for Open-Set Domain Adaptationcited by 56
- 2019Pseudo-Labeling Curriculum for Unsupervised Domain Adaptationcited by 46
- 2019Transfer Learning with Dynamic Distribution Adaptationcited by 40
- 2019Transfer Learning with Dynamic Adversarial Adaptation Networkcited by 37
- 2020Exploring Category-Agnostic Clusters for Open-Set Domain Adaptationcited by 27
- 2022Unknown-Aware Domain Adversarial Learning for Open-Set Domain Adaptationcited by 21
- 2017Active Self-Paced Learning for Cost-Effective and Progressive Face Identificationcited by 19
- 2017Conditional Adversarial Domain Adaptationcited by 10
Built on by
Citing papers per year: 2023: 2.
2 papers.