Methods › Computer Vision › Generative Adversarial Networks › BigGAN-deep

BigGAN-deep

11 papers tagged archive 2025-07-28

Introduced by Andrew Brock et al. in Large Scale GAN Training for High Fidelity Natural Image Synthesis

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

BigGAN-deep is a deeper version (4x) of BigGAN. The main difference is a slightly differently designed residual block. Here the z vector is concatenated with the conditional vector without splitting it into chunks. It is also based on residual blocks with bottlenecks. BigGAN-deep uses a different strategy than BigGAN aimed at preserving identity throughout the skip connections. In G, where the number of channels needs to be reduced, BigGAN-deep simply retains the first group of channels and drop the rest to produce the required number of channels. In D, where the number of channels should be increased, BigGAN-deep passes the input channels unperturbed, and concatenates them with the remaining channels produced by a 1 × 1 convolution. As far as the network configuration is concerned, the discriminator is an exact reflection of the generator.

There are two blocks at each resolution (BigGAN uses one), and as a result BigGAN-deep is four times deeper than BigGAN. Despite their increased depth, the BigGAN-deep models have significantly fewer parameters mainly due to the bottleneck structure of their residual blocks.

PaperSourceSee Code · ajbrock/BigGAN-PyTorch

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 11 · with a code link: 6 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (2 of 11 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 11 of 11, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

19 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Image Generation4
Conditional Image Generation3
Bias Detection2
Clustering2
Vocal Bursts Intensity Prediction2
BIG-bench Machine Learning1
Computational Efficiency1
Data Augmentation1
Denoising1
Density Estimation1
Diversity1
Fairness1
Image-Variation1
Inductive Bias1
Metric Learning1
Relational Reasoning1
Self-Supervised Learning1
Super-Resolution1
Unconditional Image Generation1

Usage over time archive 2025-07-28

Papers per year tagged with BigGAN-deep: 2018 to 2023, peak 4 4 0 2018: 1 paper 2018 2019: 1 paper 2019 2020: 2 papers 2020 2021: 4 papers 2021 2022: 2 papers 2022 2023: 1 paper 2023
Papers per year the archive tags with this method, by the paper's archive date (11 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Generative Adversarial NetworksGenerative Models

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