Papers › Augmentation-Aware Self-Supervision for Data-Efficient GAN Training

Augmentation-Aware Self-Supervision for Data-Efficient GAN Training

31 May 2022NeurIPS 2023 11arXiv:2205.15677archive 2025-07-28

Liang Hou, Qi Cao, Yige Yuan, Songtao Zhao, Chongyang Ma, Siyuan Pan, Pengfei Wan, Zhongyuan Wang, HuaWei Shen, Xueqi Cheng

Training generative adversarial networks (GANs) with limited data is challenging because the discriminator is prone to overfitting. Previously proposed differentiable augmentation demonstrates improved data efficiency of training GANs. However, the augmentation implicitly introduces undesired invariance to augmentation for the discriminator since it ignores the change of semantics in the label space caused by data transformation, which may limit the representation learning ability of the discriminator and ultimately affect the generative modeling performance of the generator. To mitigate the negative impact of invariance while inheriting the benefits of data augmentation, we propose a novel augmentation-aware self-supervised discriminator that predicts the augmentation parameter of the augmented data. Particularly, the prediction targets of real data and generated data are required to be distinguished since they are different during training. We further encourage the generator to adversarially learn from the self-supervised discriminator by generating augmentation-predictable real and not fake data. This formulation connects the learning objective of the generator and the arithmetic - harmonic mean divergence under certain assumptions. We compare our method with state-of-the-art (SOTA) methods using the class-conditional BigGAN and unconditional StyleGAN2 architectures on data-limited CIFAR-10, CIFAR-100, FFHQ, LSUN-Cat, and five low-shot datasets. Experimental results demonstrate significant improvements of our method over SOTA methods in training data-efficient GANs.

PaperPDFConference PDFCodeCode Syntology ran

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="2205.15677")

Code

Syntology Ran 6 of 18 code samples harvested from 1 repository linked to this paper; 12 have no recorded run. Of those that ran: 3 ran · our draft was wrong; 3 ran with no contract checked.

By repository: official repository: 18 samples from 1 repository, 6 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

liang-hou/augself-gan officialmentioned in paperpytorchMIT 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

18 samples harvested; 6 ran; 0 honoured the contract we drafted; 12 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.

3ran · our draft was wrong
3ran
12unverified

Licence: 0 of the 18 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 liang-hou/augself-gan. “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.

D_arch liang-hou/augself-gan/augself-biggan/BigGAN.py official repository ran · our draft was wrong MIT (permissive) · 85eb95cce203dfc7 · report
G_arch liang-hou/augself-gan/augself-biggan/BigGAN.py official repository ran · our draft was wrong MIT (permissive) · e8c308c9283407d7 · report
find_classes liang-hou/augself-gan/augself-biggan/datasets.py official repository ran MIT (permissive) · 52d10a10fb72fb9f · report
gram_schmidt liang-hou/augself-gan/augself-biggan/layers.py official repository ran · our draft was wrong MIT (permissive) · c41836f3e51fa8f1 · report
is_image_file liang-hou/augself-gan/augself-biggan/datasets.py official repository ran MIT (permissive) · 4e6a8faaf8e44abe · report
make_dataset liang-hou/augself-gan/augself-biggan/datasets.py official repository ran MIT (permissive) · 79e61b6269a450e8 · report
DiffAugment liang-hou/augself-gan/augself-biggan/DiffAugment_pytorch.py official repository unverified MIT (permissive) · 37e1e70fdd71c5ac · report
accumulate_inception_activations liang-hou/augself-gan/augself-biggan/inception_tf.py official repository unverified MIT (permissive) · f27d575950b15dab · report
add_sample_parser liang-hou/augself-gan/augself-biggan/utils.py official repository unverified MIT (permissive) · c4171e8c1ba5ea65 · report
calculate_inception_score liang-hou/augself-gan/augself-biggan/inception_tf.py official repository unverified MIT (permissive) · 16c22401d84c7ba1 · report
loss_dcgan_dis liang-hou/augself-gan/augself-biggan/losses.py official repository unverified MIT (permissive) · 982a26492dc6b7fb · report
loss_dcgan_gen liang-hou/augself-gan/augself-biggan/losses.py official repository unverified MIT (permissive) · 6c34831223553b6f · report
loss_hinge_dis liang-hou/augself-gan/augself-biggan/losses.py official repository unverified MIT (permissive) · 290cd37ab0098d5c · report
power_iteration liang-hou/augself-gan/augself-biggan/layers.py official repository unverified MIT (permissive) · 28d3a35157f2916d · report
proj liang-hou/augself-gan/augself-biggan/layers.py official repository unverified MIT (permissive) · 4015ab1f3ab9b881 · report
rand_brightness liang-hou/augself-gan/augself-biggan/DiffAugment_pytorch.py official repository unverified MIT (permissive) · 218f3a8a85aeaa48 · report
rand_saturation liang-hou/augself-gan/augself-biggan/DiffAugment_pytorch.py official repository unverified MIT (permissive) · 55891b212e588333 · report
update_config_roots liang-hou/augself-gan/augself-biggan/utils.py official repository unverified MIT (permissive) · e6f2eaa40b13c353 · report

Tasks

Data AugmentationRepresentation Learning

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