Papers › Category Anchor-Guided Unsupervised Domain Adaptation for Semantic Segmentation

Category Anchor-Guided Unsupervised Domain Adaptation for Semantic Segmentation

29 Oct 2019NeurIPS 2019 12arXiv:1910.13049archive 2025-07-28

Qiming Zhang, Jing Zhang, Wei Liu, DaCheng Tao

Unsupervised domain adaptation (UDA) aims to enhance the generalization capability of a certain model from a source domain to a target domain. UDA is of particular significance since no extra effort is devoted to annotating target domain samples. However, the different data distributions in the two domains, or \emph{domain shift/discrepancy}, inevitably compromise the UDA performance. Although there has been a progress in matching the marginal distributions between two domains, the classifier favors the source domain features and makes incorrect predictions on the target domain due to category-agnostic feature alignment. In this paper, we propose a novel category anchor-guided (CAG) UDA model for semantic segmentation, which explicitly enforces category-aware feature alignment to learn shared discriminative features and classifiers simultaneously. First, the category-wise centroids of the source domain features are used as guided anchors to identify the active features in the target domain and also assign them pseudo-labels. Then, we leverage an anchor-based pixel-level distance loss and a discriminative loss to drive the intra-category features closer and the inter-category features further apart, respectively. Finally, we devise a stagewise training mechanism to reduce the error accumulation and adapt the proposed model progressively. Experiments on both the GTA5→Cityscapes and SYNTHIA→Cityscapes scenarios demonstrate the superiority of our CAG-UDA model over the state-of-the-art methods. The code is available at \url{https://github.com/RogerZhangzz/CAG_UDA}.

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="1910.13049")

Code

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

By repository: official repository: 7 samples from 1 repository, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

RogerZhangzz/CAG_UDA officialmentioned in papermentioned 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

7 samples harvested; 3 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.

3ran · our draft was wrong
4unverified

Licence: 0 of the 7 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 RogerZhangzz/CAG_UDA. “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.

get_norm_layer RogerZhangzz/CAG_UDA/models/networks.py official repository ran · our draft was wrong MIT (permissive) · 05f3653dd76468d9 · report
get_scheduler RogerZhangzz/CAG_UDA/models/networks.py official repository ran · our draft was wrong MIT (permissive) · 62a8cdfdb51ec275 · report
init_net RogerZhangzz/CAG_UDA/models/networks.py official repository ran · our draft was wrong MIT (permissive) · bf329cef80ee24c5 · report
bootstrapped_cross_entropy2d RogerZhangzz/CAG_UDA/loss/loss.py official repository unverified MIT (permissive) · dfe03b9cbc5639c5 · report
cross_entropy2d RogerZhangzz/CAG_UDA/loss/loss.py official repository unverified MIT (permissive) · 57b36a6b7f29df1a · report
grad_reverse RogerZhangzz/CAG_UDA/models/adaptation_model.py official repository unverified MIT (permissive) · 522eaeb36b99efb4 · report
multi_scale_cross_entropy2d RogerZhangzz/CAG_UDA/loss/loss.py official repository unverified MIT (permissive) · 6ceebb622653f267 · report

Tasks

Domain AdaptationSemantic SegmentationSynthetic-to-Real TranslationUnsupervised Domain Adaptation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Image-to-Image Translation SYNTHIA-to-Cityscapes CAG-UDA mIoU (13 classes) 44.5 #24 of 28 Archive leaderboard report
Synthetic-to-Real Translation GTAV-to-Cityscapes Labels CAG-UDA mIoU 50.2 #47 of 73 Archive leaderboard report
Synthetic-to-Real Translation SYNTHIA-to-Cityscapes CAG-UDA MIoU (13 classes) 52.6 #33 of 38 Archive leaderboard report
Synthetic-to-Real Translation SYNTHIA-to-Cityscapes CAG-UDA MIoU (16 classes) 44.5 #33 of 38 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

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