Papers › Unsupervised Multi-source Domain Adaptation Without Access to Source Data

Unsupervised Multi-source Domain Adaptation Without Access to Source Data

5 Apr 2021CVPR 2021 1arXiv:2104.01845archive 2025-07-28

Sk Miraj Ahmed, Dripta S. Raychaudhuri, Sujoy Paul, Samet Oymak, Amit K. Roy-Chowdhury

Unsupervised Domain Adaptation (UDA) aims to learn a predictor model for an unlabeled domain by transferring knowledge from a separate labeled source domain. However, most of these conventional UDA approaches make the strong assumption of having access to the source data during training, which may not be very practical due to privacy, security and storage concerns. A recent line of work addressed this problem and proposed an algorithm that transfers knowledge to the unlabeled target domain from a single source model without requiring access to the source data. However, for adaptation purposes, if there are multiple trained source models available to choose from, this method has to go through adapting each and every model individually, to check for the best source. Thus, we ask the question: can we find the optimal combination of source models, with no source data and without target labels, whose performance is no worse than the single best source? To answer this, we propose a novel and efficient algorithm which automatically combines the source models with suitable weights in such a way that it performs at least as good as the best source model. We provide intuitive theoretical insights to justify our claim. Furthermore, extensive experiments are conducted on several benchmark datasets to show the effectiveness of our algorithm, where in most cases, our method not only reaches best source accuracy but also outperforms it.

PaperPDFConference PDFCodeCode Syntology ranMethod as code

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

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

By repository: community (archive-listed): 8 samples from 1 repository, 4 ran (3 with no instrument failure; 1 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.

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

driptaRC/DECISION mentioned on GitHubpytorchSyntology: 8 samples, 4 ran (1 instrument-failed) · 4 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.

Code Syntology ran Syntology

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

1ran · our draft was wrong
3ran
4unverified

Licence: 0 of the 8 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 driptaRC/DECISION. “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”. For 1 sample that ran, the graph records a signature this page does not show: for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments. “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.

driptaRC/DECISION community (archive-listed) 8 samples, 4 ran (1 instrument-failed) · 4 unverified
data_load in 15 papers adapt_multi.py ran · our draft was wrong MIT (permissive) · 7ba25b84bcf91c5a · report fixture: signature args:Args/0/? · returned dict · level recorded 2026-09-22
feat_bottleneck adapt_multi.py ran · metamorphic tier: deterministic MIT (permissive) · dc1fec3684ad2c3d · report fixture: returned feat_bottleneck · level recorded 2026-09-22
feat_classifier adapt_multi.py ran · metamorphic tier: deterministic MIT (permissive) · be3e451f783e5bab · report fixture: returned feat_classifier · level recorded 2026-09-22
scalar in 6 papers adapt_multi.py ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · 2ef8d37c92cb2fed · report fixture: returned scalar · level recorded 2026-09-22
VGGBase adapt_multi.py unverified MIT (permissive) · 26f47e76a106ed2d · report
cal_acc_multi adapt_multi.py unverified MIT (permissive) · 9a78b60ad452f989 · report
obtain_label adapt_multi.py unverified MIT (permissive) · 5b7bf620e4e50f11 · report
train_target in 5 papers adapt_multi.py unverified MIT (permissive) · b1bbbdb6f251057d · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for a novel and efficient algorithm (graph method: a novel and efficient algorithm). 19 bricks; individually on a fixture: 12 ran (of which 4 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 6 where Syntology's instrument failed) · 7 unverified. The assembly has not been run end-to-end.

  1. train_target entry · level 0 · unverified · b1bbbdb6f251057d
  2. Entropy loss · level 1 · ran · our draft was wrong · 94b5622f0aa7add1
  3. ResBase model · level 0 · unverified · 021396acc21d576b
  4. VGGBase helper · level 0 · unverified · 26f47e76a106ed2d
  5. cal_acc_multi metric · level 0 · unverified · 9a78b60ad452f989
  6. data_load data_transform · level 1 · ran · our draft was wrong · 7ba25b84bcf91c5a
  7. feat_bottleneck model · level 1 · ran · dc1fec3684ad2c3d
  8. feat_classifier model · level 1 · ran · be3e451f783e5bab
  9. lr_scheduler scheduler · level 1 · ran · our draft was wrong · 0b7ffc9f8b77529c
  10. obtain_label helper · level 0 · unverified · 5b7bf620e4e50f11
  11. op_copy helper · level 1 · ran · our draft was wrong · 93a11f62e4a129f0
  12. scalar helper · level 1 · ran · 2ef8d37c92cb2fed
  13. ImageList_idx helper · level 1 · ran · 2656e8041cf0976a
  14. image_test helper · level 1 · ran · our draft was wrong · 6e4265b7f707b718
  15. image_train helper · level 1 · ran · our draft was wrong · 35c2d572ebd185f5
  16. init_weights helper · level 0 · unverified · 7babf7ea472eba97
  17. l_loader helper · level 1 · ran · honoured contract · edd7184ac144c4fa
  18. make_dataset helper · level 0 · unverified · 2301055cb33836bc
  19. rgb_loader helper · level 1 · ran · honoured contract · 2c5ce24ea2b5d2a4

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2104.01845") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

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