Papers › Do Generated Data Always Help Contrastive Learning?

Do Generated Data Always Help Contrastive Learning?

19 Mar 2024arXiv:2403.12448archive 2025-07-28

Yifei Wang, Jizhe Zhang, Yisen Wang

Contrastive Learning (CL) has emerged as one of the most successful paradigms for unsupervised visual representation learning, yet it often depends on intensive manual data augmentations. With the rise of generative models, especially diffusion models, the ability to generate realistic images close to the real data distribution has been well recognized. These generated high-equality images have been successfully applied to enhance contrastive representation learning, a technique termed ``data inflation''. However, we find that the generated data (even from a good diffusion model like DDPM) may sometimes even harm contrastive learning. We investigate the causes behind this failure from the perspective of both data inflation and data augmentation. For the first time, we reveal the complementary roles that stronger data inflation should be accompanied by weaker augmentations, and vice versa. We also provide rigorous theoretical explanations for these phenomena via deriving its generalization bounds under data inflation. Drawing from these insights, we propose Adaptive Inflation (AdaInf), a purely data-centric strategy without introducing any extra computation cost. On benchmark datasets, AdaInf can bring significant improvements for various contrastive learning methods. Notably, without using external data, AdaInf obtains 94.70% linear accuracy on CIFAR-10 with SimCLR, setting a new record that surpasses many sophisticated methods. Code is available at https://github.com/PKU-ML/adainf.

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

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

By repository: official repository: 7 samples from 1 repository, 6 ran (3 with no instrument failure; 3 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-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

pku-ml/adainf officialmentioned in paperpytorchSyntology: 7 samples, 6 ran (3 instrument-failed) · 1 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

7 samples harvested: 6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran · our draft was wrong
1ran; the contract check could not run
3ran
1unverified

Licence: 7 of the 7 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 pku-ml/adainf. “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.

pku-ml/adainf official repository 7 samples, 6 ran (3 instrument-failed) · 1 unverified
barlow_loss_func in 13 papers solo-learn/solo/losses/barlow.py ran no licence file found · pointer only · 132a949a804eb81e · report fixture: signature z1:Tensor/2/float, z2:Tensor/2/float, lamb:float/0/float, scale_loss:float/0/float · returned Tensor · level recorded 2026-09-24
byol_loss_func in 12 papers solo-learn/solo/losses/byol.py ran fingerprinted no licence file found · pointer only · 273532e06cb3967e · report fixture: signature p:Tensor/2/float, z:Tensor/2/float, simplified:bool/0/bool · returned Tensor · level recorded 2026-09-24
extract_features in 73 papers solo-learn/main_knn.py ran; the contract check could not run (RAISES) no licence file found · pointer only · 8916e0f98b777300 · report fixture: signature loader:DataLoader/0/?, model:callable/0/? · returned tuple · level recorded 2026-09-24
mae_loss_func in 5 papers solo-learn/solo/losses/mae.py ran no licence file found · pointer only · a07d9a7525702b80 · report fixture: signature imgs:Tensor/4/float, pred:Tensor/3/float, mask:Tensor/2/float, patch_size:int/0/int, norm_pix_loss:bool/0/bool · returned Tensor · level recorded 2026-09-24
mocov2plus_loss_func in 7 papers solo-learn/solo/losses/mocov2plus.py ran · our draft was wrong fingerprinted no licence file found · pointer only · 4dd7c3cff0150cb9 · report fixture: signature query:Tensor/2/float, key:Tensor/2/float, queue:Tensor/2/float, temperature:float/0/float · returned Tensor · level recorded 2026-09-22
patchify in 32 papers
census: 6 implementations from 8 papers, 6 distinct outputs across 3 buckets, one shared input per bucket
solo-learn/solo/losses/mae.py ran · our draft was wrong no licence file found · pointer only · 3e6a557bf1ad83d9 · report fixture: signature imgs:Tensor/4/float, patch_size:int/0/int · returned Tensor · level recorded 2026-09-24
deepclusterv2_loss_func in 11 papers solo-learn/solo/losses/deepclusterv2.py unverified no licence file found · pointer only · ce432f2e9653c7a3 · report

Tasks

Contrastive LearningData AugmentationGeneralization BoundsRepresentation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Average PoolingColorJitterContrastive LearningConvolutionDense ConnectionsDiffusionFeedforward NetworkGlobal Average PoolingKaiming InitializationMax PoolingNT-XentRandom Gaussian BlurRandom Resized CropReLUSimCLR

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