Papers › Cross-Domain Adaptive Clustering for Semi-Supervised Domain Adaptation

Cross-Domain Adaptive Clustering for Semi-Supervised Domain Adaptation

19 Apr 2021CVPR 2021 1arXiv:2104.09415archive 2025-07-28

Jichang Li, Guanbin Li, Yemin Shi, Yizhou Yu

In semi-supervised domain adaptation, a few labeled samples per class in the target domain guide features of the remaining target samples to aggregate around them. However, the trained model cannot produce a highly discriminative feature representation for the target domain because the training data is dominated by labeled samples from the source domain. This could lead to disconnection between the labeled and unlabeled target samples as well as misalignment between unlabeled target samples and the source domain. In this paper, we propose a novel approach called Cross-domain Adaptive Clustering to address this problem. To achieve both inter-domain and intra-domain adaptation, we first introduce an adversarial adaptive clustering loss to group features of unlabeled target data into clusters and perform cluster-wise feature alignment across the source and target domains. We further apply pseudo labeling to unlabeled samples in the target domain and retain pseudo-labels with high confidence. Pseudo labeling expands the number of ``labeled" samples in each class in the target domain, and thus produces a more robust and powerful cluster core for each class to facilitate adversarial learning. Extensive experiments on benchmark datasets, including DomainNet, Office-Home and Office, demonstrate that our proposed approach achieves the state-of-the-art performance in semi-supervised domain adaptation.

PaperPDFConference PDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 9 code samples harvested from 2 repositories linked to this paper: 7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 4 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 4 samples from 1 repository, 4 ran (0 with no instrument failure; 4 where Syntology's instrument failed); community (archive-listed): 5 samples from 1 repository, 3 ran (3 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 1 of its repositories that Syntology harvested for other papers:

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

lijichang/CVPR2021-SSDA officialmentioned in papermentioned on GitHubpytorchSyntology: 4 samples, 4 ran (4 instrument-failed) · 0 unverified report
KaiyangZhou/Dassl.pytorch mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Domain Generalization with MixStyle (arXiv:2104.02008; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
zwenyu/UniSSDA mentioned on GitHubpytorchSyntology: 5 samples, 3 ran (0 instrument-failed) · 2 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

9 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
4ran · our draft was wrong
2ran
2unverified

Licence: 9 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

lijichang/CVPR2021-SSDA official repository 4 samples, 4 ran (4 instrument-failed) · 0 unverified
PairEnum1D losses.py ran · our draft was wrong no licence file found · pointer only · 04928299fb8af14f · report fixture: signature x:Tensor/1/float · returned tuple · level recorded 2026-09-22
PairEnum2D losses.py ran · our draft was wrong fingerprinted no licence file found · pointer only · f596b7bdbf677113 · report fixture: signature x:Tensor/2/float · returned tuple · level recorded 2026-09-22
advbce_unlabeled losses.py ran · our draft was wrong no licence file found · pointer only · 218450f6cca3efdb · report fixture: signature args:Args/0/?, target:NoneType/0/?, feat:Tensor/2/float, prob:Tensor/2/float, prob_bar:Tensor/2/float, device:device/0/?, bce:callable/0/? · returned Tensor · level recorded 2026-09-22
pairwise_target losses.py ran · our draft was wrong no licence file found · pointer only · 05c632eeb210106d · report fixture: signature args:Args/0/?, feat:Tensor/2/float, target:Tensor/1/int, device:device/0/? · returned Tensor · level recorded 2026-09-22
zwenyu/UniSSDA community (archive-listed) 5 samples, 3 ran (0 instrument-failed) · 2 unverified
BCE algorithms/algorithms.py ran fingerprinted no licence file found · pointer only · a1099a881bc91743 · report fixture: signature prob1:Tensor/2/float, prob2:Tensor/2/float, simi:Tensor/1/float · returned Tensor · level recorded 2026-09-24
BCE_softlabels algorithms/algorithms.py ran fingerprinted no licence file found · pointer only · aac8a53a357f9691 · report fixture: signature prob1:Tensor/2/float, prob2:Tensor/2/float, simi:Tensor/1/float · returned Tensor · level recorded 2026-09-24
sigmoid_rampup in 22 papers algorithms/algorithms.py ran · honoured contract fingerprinted no licence file found · pointer only · b41d2568444cbe7e · report fixture: signature current:int/0/int, rampup_length:int/0/int · returned float · level recorded 2026-09-22
CDAC algorithms/algorithms.py unverified no licence file found · pointer only · 04e06b24884611de · report
CDAC_loss algorithms/algorithms.py unverified no licence file found · pointer only · 07f94a9b6348e882 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.

2 assemblies on this paper: 2 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).

2 sibling assemblies for Cross-domain Adaptive Clustering (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for Cross-domain Adaptive Clustering (graph method: Cross-domain Adaptive Clustering). 12 bricks; individually on a fixture: 9 ran (of which 4 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. CDAC entry · level 0 · unverified · 04e06b24884611de
  2. Algorithm helper · level 1 · ran · 39253084070f2f95
  3. BCE_softlabels helper · level 1 · ran · aac8a53a357f9691
  4. CDAC_loss loss · level 0 · unverified · 07f94a9b6348e882
  5. Classifier model · level 1 · ran · 9a932222d08965d6
  6. inv_lr_scheduler helper · level 1 · ran · our draft was wrong · f069b56fa07b8d15
  7. sigmoid_rampup helper · level 1 · ran · honoured contract · b41d2568444cbe7e
  8. weights_init helper · level 0 · unverified · fad33bd48f70436d
  9. BCE helper · level 1 · ran · a1099a881bc91743
  10. grad_reverse helper · level 1 · ran · honoured contract · 568eece08bf61ac5
  11. pretrain helper · level 1 · ran · 08c87afb301070b5
  12. GradReverse helper · level 1 · ran · 2b47a2ddfc97b026

harvested Assembly for Cross-domain Adaptive Clustering (graph method: Cross-domain Adaptive Clustering). 4 bricks; individually on a fixture: 4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. advbce_unlabeled entry · level 1 · ran · our draft was wrong · 218450f6cca3efdb
  2. PairEnum2D helper · level 1 · ran · our draft was wrong · f596b7bdbf677113
  3. pairwise_target helper · level 1 · ran · our draft was wrong · 05c632eeb210106d
  4. PairEnum1D helper · level 1 · ran · our draft was wrong · 04928299fb8af14f

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2104.09415") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

ClusteringDomain AdaptationSemi-supervised Domain Adaptation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections