Papers › Data-Efficient GAN Training Beyond (Just) Augmentations: A Lottery Ticket Perspective

Data-Efficient GAN Training Beyond (Just) Augmentations: A Lottery Ticket Perspective

28 Feb 2021NeurIPS 2021 12arXiv:2103.00397archive 2025-07-28

Tianlong Chen, Yu Cheng, Zhe Gan, Jingjing Liu, Zhangyang Wang

Training generative adversarial networks (GANs) with limited real image data generally results in deteriorated performance and collapsed models. To conquer this challenge, we are inspired by the latest observation, that one can discover independently trainable and highly sparse subnetworks (a.k.a., lottery tickets) from GANs. Treating this as an inductive prior, we suggest a brand-new angle towards data-efficient GAN training: by first identifying the lottery ticket from the original GAN using the small training set of real images; and then focusing on training that sparse subnetwork by re-using the same set. We find our coordinated framework to offer orthogonal gains to existing real image data augmentation methods, and we additionally present a new feature-level augmentation that can be applied together with them. Comprehensive experiments endorse the effectiveness of our proposed framework, across various GAN architectures (SNGAN, BigGAN, and StyleGAN-V2) and diverse datasets (CIFAR-10, CIFAR-100, Tiny-ImageNet, ImageNet, and multiple few-shot generation datasets). Codes are available at: https://github.com/VITA-Group/Ultra-Data-Efficient-GAN-Training.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page 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

VITA-Group/Ultra-Data-Efficient-GAN-Training officialmentioned in papermentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Differentiable Augmentation for Data-Efficient GAN Training (arXiv:2006.10738; that paper's own run record: 49 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 3 honoured, 1 violated, 13 with no contract checked; 32 where Syntology's instrument failed) · 9 unverified); nothing checks that they implement this paper's method. 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Data Augmentation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

1x1 ConvolutionAdamBatch NormalizationBigGANConditional Batch NormalizationConvolutionDense ConnectionsEarly StoppingFeedforward NetworkGAN Hinge LossLinear LayerNon-Local BlockNon-Local OperationOff-Diagonal Orthogonal RegularizationProjection DiscriminatorReLUResidual BlockResidual ConnectionSAGANSoftmaxSpectral NormalizationTTURTruncation Trick

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