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 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

The archive's official repository (val-iisc/stickerda) was not harvested; the 13 samples below come from 1 community repository.

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

By repository: community (archive-listed): 13 samples from 1 repository, 10 ran (6 with no instrument failure; 4 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-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 3 of the 10 samples that ran have no recorded date.

val-iisc/stickerda officialmentioned in paperpytorchSyntology: not harvested report
albert0147/nrc_sfda mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Exploiting the Intrinsic Neighborhood Structure for Source-free Domain Adaptation (arXiv:2110.04202; that paper's own run record: 0 ran · 1 unverified); nothing checks that they implement this paper's method. report
albert0147/sfda_neighbors mentioned on GitHubpytorchMITSyntology: 13 samples, 10 ran (4 instrument-failed) · 3 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

13 samples harvested: 10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 3 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.

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

Licence: 7 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. For 7 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. 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. 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. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

albert0147/sfda_neighbors community (archive-listed) 13 samples, 10 ran (4 instrument-failed) · 3 unverified
Entropy in 31 papers
census: 7 implementations from 10 papers, 1 distinct output on one shared input this sample: bucket 1 of 1, arg 1: rank 2, kind float, dtype float32
train_src.py ran · our draft was wrong fingerprinted MIT (permissive) here; the stored copy is pointer only · 94b5622f0aa7add1 · report fixture: signature input_:Tensor/2/float · returned Tensor · level recorded, date not recorded
image_train in 18 papers office-home/utils.py ran MIT (permissive) · 620153a1ea154802 · report fixture: signature resize_size:int/0/int, crop_size:int/0/int · returned Compose · level recorded 2026-09-25
l_loader in 13 papers data_list.py ran · honoured contract MIT (permissive) here; the stored copy is pointer only · edd7184ac144c4fa · report fixture: signature path:str/0/str · returned Image · level recorded 2026-09-22
lr_scheduler in 32 papers train_src.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · 0b7ffc9f8b77529c · report fixture: signature optimizer:SGD/0/?, iter_num:int/0/int, max_iter:int/0/int, gamma:int/0/int, power:float/0/float · returned SGD · level recorded, date not recorded
normal_pc pointDA-10/data_utils.py ran fingerprinted MIT (permissive) · f86204d9430dcd24 · report fixture: signature pc:ndarray/2/float · returned ndarray · level recorded 2026-09-25
op_copy in 17 papers train_src.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · 93a11f62e4a129f0 · report fixture: signature optimizer:SGD/0/? · returned SGD · level recorded, date not recorded
print_args office-home/train_src.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · e8974f7e1bb05660 · report fixture: signature args:StandInArgs/0/? · returned str · level recorded 2026-09-22
rgb_loader in 16 papers data_list.py ran · honoured contract MIT (permissive) · 2c5ce24ea2b5d2a4 · report fixture: signature path:str/0/str · returned Image · level recorded 2026-09-22
rotate_point_cloud_by_angle in 5 papers pointDA-10/data_utils.py ran MIT (permissive) · a9eeefba3130b91b · report fixture: signature pc:ndarray/3/float, rotation_angle:float/0/float · returned ndarray · level recorded 2026-09-25
rotation_point_cloud pointDA-10/data_utils.py ran fingerprinted MIT (permissive) · 5840e5d37ebb8c83 · report fixture: signature pc:ndarray/3/float · returned ndarray · level recorded 2026-09-25
cal_acc_ office-home/utils.py unverified MIT (permissive) · 8af85107f49edf4b · report
calc_coeff in 14 papers network.py unverified MIT (permissive) here; the stored copy is pointer only · e352afa5762c5a6b · report
make_dataset in 144 papers data_list.py unverified MIT (permissive) here; the stored copy is pointer only · 2301055cb33836bc · 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