Papers › AdaMatch: A Unified Approach to Semi-Supervised Learning and Domain Adaptation

AdaMatch: A Unified Approach to Semi-Supervised Learning and Domain Adaptation

8 Jun 2021ICLR 2022 4arXiv:2106.04732archive 2025-07-28

David Berthelot, Rebecca Roelofs, Kihyuk Sohn, Nicholas Carlini, Alex Kurakin

We extend semi-supervised learning to the problem of domain adaptation to learn significantly higher-accuracy models that train on one data distribution and test on a different one. With the goal of generality, we introduce AdaMatch, a method that unifies the tasks of unsupervised domain adaptation (UDA), semi-supervised learning (SSL), and semi-supervised domain adaptation (SSDA). In an extensive experimental study, we compare its behavior with respective state-of-the-art techniques from SSL, SSDA, and UDA on vision classification tasks. We find AdaMatch either matches or significantly exceeds the state-of-the-art in each case using the same hyper-parameters regardless of the dataset or task. For example, AdaMatch nearly doubles the accuracy compared to that of the prior state-of-the-art on the UDA task for DomainNet and even exceeds the accuracy of the prior state-of-the-art obtained with pre-training by 6.4% when AdaMatch is trained completely from scratch. Furthermore, by providing AdaMatch with just one labeled example per class from the target domain (i.e., the SSDA setting), we increase the target accuracy by an additional 6.1%, and with 5 labeled examples, by 13.6%.

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

The archive's official repository (google-research/adamatch) was not harvested; the 20 samples below come from 4 community repositories.

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

By repository: community (archive-listed): 20 samples from 4 repositories, 15 ran (13 with no instrument failure; 2 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 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. 1 of the 15 samples that ran has no recorded date.

google-research/adamatch officialmentioned in papermentioned on GitHubjaxApache-2.0Syntology: not harvested report
smkim7-kr/AdaMatch-pytorch mentioned on GitHubpytorchMITSyntology: 8 samples, 6 ran (1 instrument-failed) · 2 unverified report
yizhe-ang/AdaMatch-PyTorch mentioned on GitHubpytorchMITSyntology: 2 samples, 2 ran (0 instrument-failed) · 0 unverified report
zwenyu/UniSSDA mentioned on GitHubpytorchSyntology: 9 samples, 6 ran (1 instrument-failed) · 3 unverified report
zysymu/AdaMatch-pytorch mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
sayakpaul/AdaMatch-TF tfApache-2.0Syntology: not harvested 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

20 samples harvested: 15 ran (of which 5 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 5 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 · honoured contract
2ran · our draft was wrong
12ran
5unverified

Licence: 10 of the 20 samples are pointer only, meaning Syntology does not serve that copy's text. For 1 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 4 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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.

smkim7-kr/AdaMatch-pytorch community (archive-listed) 8 samples, 6 ran (1 instrument-failed) · 2 unverified
LookaheadAdam src/optimizer.py ran MIT (permissive) · c9f6230a51d9b5e9 · report fixture: signature params:generator/0/?, alpha:float/0/float, k:int/0/int · returned Lookahead · level recorded 2026-09-24
accuracy in 872 papers
census: 8 implementations from 7 papers, 7 distinct outputs across 6 buckets, one shared input per bucket
src/utils.py ran MIT (permissive) · 4c0ed8a3ffc26a8b · report fixture: signature output:Tensor/2/float, target:Tensor/1/int, topk:tuple/1/int · returned Tensor · level recorded 2026-09-24
conv3x3 in 1,376 papers models.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · 00e569acd6b45ef0 · report fixture: signature in_planes:int/0/int, out_planes:int/0/int, stride:int/0/int · returned Conv2d · level recorded, date not recorded
get_logger in 383 papers src/logger.py ran MIT (permissive) · 6066adc7a58afde6 · report fixture: signature name:str/0/str, level:int/0/int · returned Logger · level recorded 2026-09-25
load_model in 479 papers models.py ran MIT (permissive) · 33836088c3046a9e · report fixture: signature args:Args/0/? · returned Wide_ResNet · level recorded 2026-09-24
make_scheduler in 9 papers src/scheduler.py ran MIT (permissive) · 69813457472b3348 · report fixture: signature args:Args/0/?, optimizer:SGD/0/? · returned GradualWarmupScheduler · level recorded 2026-09-24
Over9000 src/optimizer.py unverified MIT (permissive) · 0f150f7b3d28baf0 · report
make_optimizer in 32 papers src/optimizer.py unverified MIT (permissive) · 0c2325bd115425e9 · report
yizhe-ang/AdaMatch-PyTorch community (archive-listed) 2 samples, 2 ran (0 instrument-failed) · 0 unverified
cosine_schedule in 14 papers trainers/utils.py ran fingerprinted MIT (permissive) · 90da0a5322508429 · report fixture: signature iter:int/0/int, max_iter:int/0/int, decay:float/0/float · returned float · level recorded 2026-09-24
unnormalize_img trainers/utils.py ran MIT (permissive) · 33cf5d0c4a76211f · report fixture: signature img:Tensor/3/float, mean:list/1/float, std:list/1/float · returned Tensor · level recorded 2026-09-24
zwenyu/UniSSDA community (archive-listed) 9 samples, 6 ran (1 instrument-failed) · 3 unverified
Algorithm in 26 papers algorithms/algorithms.py ran · metamorphic tier: deterministic no licence file found · pointer only · 39253084070f2f95 · report fixture: returned Algorithm · level recorded 2026-09-22
Classifier in 72 papers algorithms/algorithms.py ran · metamorphic tier: deterministic no licence file found · pointer only · 9a932222d08965d6 · report fixture: returned Classifier · level recorded 2026-09-22
GradReverse in 12 papers algorithms/algorithms.py ran no licence file found · pointer only · 2b47a2ddfc97b026 · report fixture: returned GradReverse · level recorded 2026-09-22
grad_reverse in 35 papers
census: 12 implementations from 17 papers, 1 distinct output on one shared input this sample: bucket 1 of 1, arg 1: rank 2, kind float, dtype float32
algorithms/algorithms.py ran · honoured contract fingerprinted no licence file found · pointer only · 568eece08bf61ac5 · report fixture: signature x:Tensor/2/float, lambd:float/0/float · returned Tensor · level recorded 2026-09-22
inv_lr_scheduler in 11 papers algorithms/algorithms.py ran · our draft was wrong no licence file found · pointer only · f069b56fa07b8d15 · report fixture: signature param_lr:list/1/float, optimizer:SGD/0/?, iter_num:int/0/int, gamma:float/0/float, power:float/0/float, init_lr:float/0/float · returned SGD · level recorded 2026-09-22
pretrain algorithms/algorithms.py ran · metamorphic tier: deterministic no licence file found · pointer only · 08c87afb301070b5 · report fixture: returned pretrain · level recorded 2026-09-22
AdaMatch algorithms/algorithms.py unverified no licence file found · pointer only · 4fcf58e0e0f0df7d · report
AdaMatch_loss algorithms/algorithms.py unverified no licence file found · pointer only · 3d16ce208399a304 · report
weights_init in 44 papers algorithms/algorithms.py unverified no licence file found · pointer only · fad33bd48f70436d · report
zysymu/AdaMatch-pytorch community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
Adamatch adamatch.py ran MIT (permissive) · 8acbdc077110ba9b · report fixture: returned Adamatch · level recorded 2026-09-22

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. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.

2 assemblies on this paper: 2 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).

2 sibling assemblies for AdaMatch (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

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

one of 2 siblings

  1. AdaMatch entry · level 0 · unverified · 4fcf58e0e0f0df7d
  2. AdaMatch_loss loss · level 0 · unverified · 3d16ce208399a304
  3. Algorithm helper · level 1 · ran · 39253084070f2f95
  4. Classifier model · level 1 · ran · 9a932222d08965d6
  5. inv_lr_scheduler scheduler · level 1 · ran · our draft was wrong · f069b56fa07b8d15
  6. weights_init helper · level 0 · unverified · fad33bd48f70436d
  7. grad_reverse helper · level 1 · ran · honoured contract · 568eece08bf61ac5
  8. pretrain helper · level 1 · ran · 08c87afb301070b5
  9. GradReverse helper · level 1 · ran · 2b47a2ddfc97b026

harvested Assembly for AdaMatch (graph method: AdaMatch). 1 brick; individually on a fixture: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 2 siblings

  1. Adamatch entry · level 1 · ran · 8acbdc077110ba9b

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="2106.04732") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Domain AdaptationSemi-supervised 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