Gradient-Based Sample Selection for Black-Box Universal Domain Adaptation
Qiuyan He, Minghua Deng
Abstract
Universal domain adaptation (UniDA) transfers knowledge from a labelled source domain to an unlabelled target domain under domain-shift and category-shift for annotation. In reality, due to privacy protection or other limits, not only source data but also pre-trained models on it may be unavailable when training on target data. In this paper, we go a step further to explore the black-box universal domain adaptation (B^2-UniDA) problem. It requires tackling the labelling task under shifts by only accessing the interface of pre-trained source models. To this end, we introduce GSS which proposes a novel sample selection criterion based on gradient descent and Bayes' Theorem to identify samples of potential unknown classes. This criterion doesn't require manually-set thresholds depending on data used and is suitable for various datasets. GSS builds an open-set classifier and enables it to estimate probabilities of belonging to each class including the unknown category and adjust estimates adaptively. To overcome class-imbalance, especially imbalance between the unknown and known classes, we propose a balancing mechanism by measuring training status and estimating DA type. In addition to distilling knowledge from source model outputs, we focus on mining the categorical structure of target domain by self-training. Experiments on benchmarks show the state-of-the-art performance of GSS compared to typical methods, including source models or source data dependent methods.
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 2dfcee1a-c623-4407-9a48-df14f175f9efBuilds on10
- Moment Matching for Multi-Source Domain AdaptationXingchao Peng, Qinxun Bai, Xide Xia, Zijun Huang et al.ICCV 2019 · 2,239 citations
- Universal Domain Adaptation through Self SupervisionKuniaki Saito, Donghyun Kim, Stan Sclaroff, Kate SaenkoNeurIPS 2020 · 401 citations
- OVANet: One-vs-All Network for Universal Domain AdaptationKuniaki Saito, Kate SaenkoICCV 2021 · 192 citations
- Evidential Neighborhood Contrastive Learning for Universal Domain AdaptationLiang Chen, Yihang Lou, Jianzhong He, Tao Bai et al.AAAI 2022 · 48 citations
- Geometric Anchor Correspondence Mining with Uncertainty Modeling for Universal Domain AdaptationLiang Chen, Yihang Lou, Jianzhong He, Tao Bai et al.CVPR 2022 · 46 citations
Related papers
- ADU: Adaptive Detection of Unknown Categories in Black-Box Domain AdaptationYushan Lai, Guowen Li, Haoyuan Liang, Juepeng Zheng et al.CVPR 2025
- Mutual Nearest Neighbor Contrast and Hybrid Prototype Self-Training for Universal Domain AdaptationLiang Chen, Qianjin Du, Yihang Lou, Jianzhong He et al.AAAI 2022 · 33 citations
- DINE: Domain Adaptation from Single and Multiple Black-box PredictorsJian Liang, Dapeng Hu, Jiashi Feng, Ran HeCVPR 2022 · 80 citations
- Self-Labeling Framework for Novel Category Discovery over DomainsQing Yu, Daiki Ikami, Go Irie, Kiyoharu AizawaAAAI 2022 · 33 citations
- Domain Adaptation under Open Set Label ShiftSaurabh Garg, Sivaraman Balakrishnan, Zachary C. LiptonNeurIPS 2022 · 57 citations
