Papers › Confidence-based Visual Dispersal for Few-shot Unsupervised Domain Adaptation

Confidence-based Visual Dispersal for Few-shot Unsupervised Domain Adaptation

27 Sep 2023ICCV 2023 1arXiv:2309.15575archive 2025-07-28

Yizhe Xiong, Hui Chen, Zijia Lin, Sicheng Zhao, Guiguang Ding

Unsupervised domain adaptation aims to transfer knowledge from a fully-labeled source domain to an unlabeled target domain. However, in real-world scenarios, providing abundant labeled data even in the source domain can be infeasible due to the difficulty and high expense of annotation. To address this issue, recent works consider the Few-shot Unsupervised Domain Adaptation (FUDA) where only a few source samples are labeled, and conduct knowledge transfer via self-supervised learning methods. Yet existing methods generally overlook that the sparse label setting hinders learning reliable source knowledge for transfer. Additionally, the learning difficulty difference in target samples is different but ignored, leaving hard target samples poorly classified. To tackle both deficiencies, in this paper, we propose a novel Confidence-based Visual Dispersal Transfer learning method (C-VisDiT) for FUDA. Specifically, C-VisDiT consists of a cross-domain visual dispersal strategy that transfers only high-confidence source knowledge for model adaptation and an intra-domain visual dispersal strategy that guides the learning of hard target samples with easy ones. We conduct extensive experiments on Office-31, Office-Home, VisDA-C, and DomainNet benchmark datasets and the results demonstrate that the proposed C-VisDiT significantly outperforms state-of-the-art FUDA methods. Our code is available at https://github.com/Bostoncake/C-VisDiT.

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

Code

Syntology Ran 12 of 12 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 12 ran with no contract checked.

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

bostoncake/c-visdit 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

12 samples harvested; 12 ran; 0 honoured the contract we drafted; 0 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.

12ran

Licence: 0 of the 12 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 Bostoncake/C-VisDiT. “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.

MB Bostoncake/C-VisDiT/src/utils/utils.py official repository ran fingerprinted MIT (permissive) · 48b20451d07149ee · report
compute_variance Bostoncake/C-VisDiT/src/models/clustering.py official repository ran MIT (permissive) · f64acac08bfc5025 · report
create_image_label Bostoncake/C-VisDiT/src/utils/datautils.py official repository ran MIT (permissive) · 26786c8286afa205 · report
dot Bostoncake/C-VisDiT/src/utils/torchutils.py official repository ran fingerprinted MIT (permissive) · 1e0141e585a4efff · report
expand_1d Bostoncake/C-VisDiT/src/utils/torchutils.py official repository ran fingerprinted MIT (permissive) · 8ec8882f2838c3bd · report
get_class_map Bostoncake/C-VisDiT/src/utils/datautils.py official repository ran MIT (permissive) · 5d44c71946b6f266 · report
get_class_num Bostoncake/C-VisDiT/src/utils/datautils.py official repository ran MIT (permissive) · 7ce582ebe242e5a9 · report
isin Bostoncake/C-VisDiT/src/utils/torchutils.py official repository ran MIT (permissive) · 1b618c5871d8bcda · report
per Bostoncake/C-VisDiT/src/utils/utils.py official repository ran fingerprinted MIT (permissive) · 4abb62f56d6ba58a · report
reverse_domain Bostoncake/C-VisDiT/src/utils/utils.py official repository ran MIT (permissive) · 80b2cb25e031866f · report
torch_kmeans Bostoncake/C-VisDiT/src/models/clustering.py official repository ran MIT (permissive) · 59907900694e423a · report
update_data_memory Bostoncake/C-VisDiT/src/models/ssda.py official repository ran fingerprinted MIT (permissive) · 275077fab26484e0 · report

Tasks

Domain AdaptationSelf-Supervised LearningTransfer LearningUnsupervised 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