Papers › Unsupervised Domain Adaptation via Structurally Regularized Deep Clustering

Unsupervised Domain Adaptation via Structurally Regularized Deep Clustering

19 Mar 2020CVPR 2020 6arXiv:2003.08607archive 2025-07-28

Hui Tang, Ke Chen, Kui Jia

Unsupervised domain adaptation (UDA) is to make predictions for unlabeled data on a target domain, given labeled data on a source domain whose distribution shifts from the target one. Mainstream UDA methods learn aligned features between the two domains, such that a classifier trained on the source features can be readily applied to the target ones. However, such a transferring strategy has a potential risk of damaging the intrinsic discrimination of target data. To alleviate this risk, we are motivated by the assumption of structural domain similarity, and propose to directly uncover the intrinsic target discrimination via discriminative clustering of target data. We constrain the clustering solutions using structural source regularization that hinges on our assumed structural domain similarity. Technically, we use a flexible framework of deep network based discriminative clustering that minimizes the KL divergence between predictive label distribution of the network and an introduced auxiliary one; replacing the auxiliary distribution with that formed by ground-truth labels of source data implements the structural source regularization via a simple strategy of joint network training. We term our proposed method as Structurally Regularized Deep Clustering (SRDC), where we also enhance target discrimination with clustering of intermediate network features, and enhance structural regularization with soft selection of less divergent source examples. Careful ablation studies show the efficacy of our proposed SRDC. Notably, with no explicit domain alignment, SRDC outperforms all existing methods on three UDA benchmarks.

PaperPDFConference PDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2003.08607")

Code

Syntology Ran 2 of 6 code samples harvested from 1 repository linked to this paper; 4 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 1 ran with no contract checked.

By repository: community (archive-listed): 6 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

huitangtang/SRDC-CVPR2020 officialmentioned in papermentioned on GitHubpytorchMIT report
gorilla-lab-scut/srdc-cvpr2020 mentioned on GitHubpytorchMIT 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.

Code Syntology ran Syntology

6 samples harvested; 2 ran; 0 honoured the contract we drafted; 4 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
1ran
4unverified

Licence: 0 of the 6 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 gorilla-lab-scut/srdc-cvpr2020. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

conv3x3 gorilla-lab-scut/srdc-cvpr2020/models/resnet.py community (archive-listed) ran · our draft was wrong MIT (permissive) · fac5364e2f53c6db · report
has_file_allowed_extension gorilla-lab-scut/srdc-cvpr2020/utils/folder.py community (archive-listed) ran MIT (permissive) · 1d7c68b369e70ab0 · report
is_image_file gorilla-lab-scut/srdc-cvpr2020/utils/folder.py community (archive-listed) unverified MIT (permissive) · 2d2234ff68f9f460 · report
make_dataset gorilla-lab-scut/srdc-cvpr2020/utils/folder.py community (archive-listed) unverified MIT (permissive) · 614271f5fabb3651 · report
resnet101 gorilla-lab-scut/srdc-cvpr2020/models/resnet.py community (archive-listed) unverified MIT (permissive) · 22d0ebffba4ad6a5 · report
resnet50 gorilla-lab-scut/srdc-cvpr2020/models/resnet.py community (archive-listed) unverified MIT (permissive) · b5a2b5ee46d974cb · report

Tasks

ClusteringDeep ClusteringDomain AdaptationUnsupervised Domain Adaptation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Introduced by this paper: SRDC

SRDC

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