Mingkui Tan, Yifan Zhang, Shuaicheng Niu, Hongbin Lin, Qing Du, Zhen Qiu, Yanxia Liu
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We study a practical domain adaptation task, called source-free unsupervised domain adaptation (UDA) problem, in which we cannot access source domain data due to data privacy issues but only a pre-trained source model and unlabeled target data are available. This task, however, is very difficult due to one key challenge: the lack of source data and target domain labels makes model adaptation very challenging. To address this, we propose to mine the hidden knowledge in the source model and exploit it to generate source avatar prototypes (i.e., representative features for each source class) as well as target pseudo labels for domain alignment. To this end, we propose a Contrastive Prototype Generation and Adaptation (CPGA) method. Specifically, CPGA consists of two stages: (1) prototype generation: by exploring the classification boundary information of the source model, we train a prototype generator to generate avatar prototypes via contrastive learning. (2) prototype adaptation: based on the generated source prototypes and target pseudo labels, we develop a new robust contrastive prototype adaptation strategy to align each pseudo-labeled target data to the corresponding source prototypes. Extensive experiments on three UDA benchmark datasets demonstrate the effectiveness and superiority of the proposed method.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.15326")
get_code_for_paper("2106.15326")
have("2106.15326")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.15326.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.15326)
Connect an agent — have() is free.