Pith. sign in

REVIEW 1 cited by

Unsupervised Data Augmentation for Consistency Training

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1904.12848 v6 pith:J2EM7SJN submitted 2019-04-29 cs.LG cs.AIcs.CLcs.CVstat.ML

classification cs.LGcs.AIcs.CLcs.CVstat.ML
keywords dataexampleslabeledlearningmethodwhenaugmentationconsistency
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 1,623 citations worldwide. Full citation record

  1. Optimizing Small Transformer-Based Language Models for Multi-Label Sentiment Analysis in Short Texts

    cs.CL 2025-09 conditional novelty 4.0 of 10

    On SemEval 2025 Task 11 short texts, generated data helped some BERT models, continued pretraining was mixed, and classification head changes barely mattered.

Pith tools