Papers › Concurrent Subsidiary Supervision for Unsupervised Source-Free Domain Adaptation

Concurrent Subsidiary Supervision for Unsupervised Source-Free Domain Adaptation

27 Jul 2022arXiv:2207.13247archive 2025-07-28

Jogendra Nath Kundu, Suvaansh Bhambri, Akshay Kulkarni, Hiran Sarkar, Varun Jampani, R. Venkatesh Babu

The prime challenge in unsupervised domain adaptation (DA) is to mitigate the domain shift between the source and target domains. Prior DA works show that pretext tasks could be used to mitigate this domain shift by learning domain invariant representations. However, in practice, we find that most existing pretext tasks are ineffective against other established techniques. Thus, we theoretically analyze how and when a subsidiary pretext task could be leveraged to assist the goal task of a given DA problem and develop objective subsidiary task suitability criteria. Based on this criteria, we devise a novel process of sticker intervention and cast sticker classification as a supervised subsidiary DA problem concurrent to the goal task unsupervised DA. Our approach not only improves goal task adaptation performance, but also facilitates privacy-oriented source-free DA i.e. without concurrent source-target access. Experiments on the standard Office-31, Office-Home, DomainNet, and VisDA benchmarks demonstrate our superiority for both single-source and multi-source source-free DA. Our approach also complements existing non-source-free works, achieving leading performance.

PaperPDFCodeCode 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="2207.13247")

Code

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

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

val-iisc/stickerda officialmentioned in paperpytorch report
albert0147/nrc_sfda mentioned on GitHubpytorch report
albert0147/sfda_neighbors 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

13 samples harvested; 6 ran; 2 honoured the contract we drafted; 7 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.

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

Licence: 0 of the 13 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 albert0147/sfda_neighbors. “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.

Entropy albert0147/sfda_neighbors/train_src.py community (archive-listed) ran · our draft was wrong fingerprinted MIT (permissive) · 94b5622f0aa7add1 · report
l_loader albert0147/sfda_neighbors/data_list.py community (archive-listed) ran · honoured contract MIT (permissive) · edd7184ac144c4fa · report
lr_scheduler albert0147/sfda_neighbors/train_src.py community (archive-listed) ran · our draft was wrong MIT (permissive) · 0b7ffc9f8b77529c · report
op_copy albert0147/sfda_neighbors/train_src.py community (archive-listed) ran · our draft was wrong MIT (permissive) · 93a11f62e4a129f0 · report
print_args albert0147/sfda_neighbors/office-home/train_src.py community (archive-listed) ran · our draft was wrong MIT (permissive) · e8974f7e1bb05660 · report
rgb_loader albert0147/sfda_neighbors/data_list.py community (archive-listed) ran · honoured contract MIT (permissive) · 2c5ce24ea2b5d2a4 · report
cal_acc_ albert0147/sfda_neighbors/office-home/utils.py community (archive-listed) unverified MIT (permissive) · 8af85107f49edf4b · report
calc_coeff albert0147/sfda_neighbors/network.py community (archive-listed) unverified MIT (permissive) · e352afa5762c5a6b · report
image_train albert0147/sfda_neighbors/office-home/utils.py community (archive-listed) unverified MIT (permissive) · 620153a1ea154802 · report
make_dataset albert0147/sfda_neighbors/data_list.py community (archive-listed) unverified MIT (permissive) · 2301055cb33836bc · report
normal_pc albert0147/sfda_neighbors/pointDA-10/data_utils.py community (archive-listed) unverified MIT (permissive) · f86204d9430dcd24 · report
rotate_point_cloud_by_angle albert0147/sfda_neighbors/pointDA-10/data_utils.py community (archive-listed) unverified MIT (permissive) · a9eeefba3130b91b · report
rotation_point_cloud albert0147/sfda_neighbors/pointDA-10/data_utils.py community (archive-listed) unverified MIT (permissive) · 5840e5d37ebb8c83 · report

Tasks

Domain AdaptationSource-Free Domain AdaptationUnsupervised 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