Papers › Unsupervised Data Augmentation for Consistency Training
Unsupervised Data Augmentation for Consistency Training
Qizhe Xie, Zihang Dai, Eduard Hovy, Minh-Thang Luong, Quoc V. Le
Semi-supervised learning lately has shown much promise in improving deep learning models when labeled data is scarce. Common among recent approaches is the use of consistency training on a large amount of unlabeled data to constrain model predictions to be invariant to input noise. In this work, we present a new perspective on how to effectively noise unlabeled examples and argue that the quality of noising, specifically those produced by advanced data augmentation methods, plays a crucial role in semi-supervised learning. By substituting simple noising operations with advanced data augmentation methods such as RandAugment and back-translation, our method brings substantial improvements across six language and three vision tasks under the same consistency training framework. On the IMDb text classification dataset, with only 20 labeled examples, our method achieves an error rate of 4.20, outperforming the state-of-the-art model trained on 25,000 labeled examples. On a standard semi-supervised learning benchmark, CIFAR-10, our method outperforms all previous approaches and achieves an error rate of 5.43 with only 250 examples. Our method also combines well with transfer learning, e.g., when finetuning from BERT, and yields improvements in high-data regime, such as ImageNet, whether when there is only 10% labeled data or when a full labeled set with 1.3M extra unlabeled examples is used. Code is available at https://github.com/google-research/uda.
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="1904.12848")
Code
Syntology Ran 15 of 52 code samples harvested from 12 repositories linked to this paper; 37 have no recorded run. Of those that ran: 4 ran · our draft was wrong; 4 ran · fixture could not drive it; 7 ran with no contract checked.
By repository: official repository: 24 samples from 1 repository, 0 ran; community (archive-listed): 28 samples from 11 repositories, 15 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
20 repositories listed; official and paper-mentioned ones first.
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
52 samples harvested; 15 ran; 0 honoured the contract we drafted; 37 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.
Licence: 9 of the 52 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 12 repositories linked to this paper, official or community; each sample names its own and says which. “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.
63d1e64fcc8da86a · report
4cd09bb78a67af39 · report
b041de8f4abb1b10 · report
98430a824c0f53a8 · report
914d0b8791ca87d0 · report
a7723bf702941670 · report
fb66342c3f664ee6 · report
97c1d8a99764fb25 · report
d00f20643f490779 · report
5b70acc56bd3291f · report
d90af0b30176ac15 · report
81e5d3b478f3469c · report
d468fe223b1a25a2 · report
b417179a5b5e0e14 · report
89985ecf00256155 · report
6895a8402ea9ee79 · report
17411729594afb42 · report
0175d515a039d4f8 · report
1902057ba4826690 · report
6e1198a9c8c47438 · report
c6512991cdef483b · report
f6b18b79eccd8391 · report
563e25e514f4a2a6 · report
f3f5fce61e36ad06 · report
9355efdc819d943e · report
36741a983d72bd68 · report
1a1dcc06f81c3c75 · report
5722c1e755019115 · report
b92936d1f2ac3e6c · report
008c64b77c4ae4c9 · report
ab50d5bbcf589623 · report
e69c03b0ebf8765a · report
00e569acd6b45ef0 · report
df213afe1b71adfd · report
40d3c39a403ae1f7 · report
bfec53e668f92651 · report
7900a3a6deef908b · report
64a6c97a5657e37a · report
a359f54f3b9012c2 · report
e46d15e93318b254 · report
b9d05e119e47da9f · report
41b7d839c5008446 · report
3458a17eb1c6c95f · report
3ccb35170e45f022 · report
cbc36864ed1d2c42 · report
2f093dc1c7296f6c · report
f018413f261238f7 · report
406265b8de6d26a2 · report
6066adc7a58afde6 · report
83a7585173c63bc5 · report
36c684d7fa0846c8 · report
6cb91780680fb891 · report
Tasks
Results from the paper archive 2025-07-28
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
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