{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/biggan-deep","slug":"biggan-deep","name":"BigGAN-deep","full_name":"BigGAN-deep","full_name_withheld":false,"description_markdown":"**BigGAN-deep** is a deeper version (4x) of [BigGAN](https://paperswithcode.com/method/biggan).  The main difference is a slightly differently designed [residual block](https://paperswithcode.com/method/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](https://paperswithcode.com/method/convolution). As far as the\r\nnetwork configuration is concerned, the discriminator is an exact reflection of the generator. \r\n\r\nThere are two blocks at each resolution (BigGAN uses one), and as a result BigGAN-deep is four times\r\ndeeper than BigGAN. Despite their increased depth, the BigGAN-deep models have significantly\r\nfewer parameters mainly due to the bottleneck structure of their residual blocks.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Large Scale GAN Training for High Fidelity Natural Image Synthesis","paper":"/paper/large-scale-gan-training-for-high-fidelity","first_author":"Andrew Brock","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/large-scale-gan-training-for-high-fidelity"},"source":{"url":"http://arxiv.org/abs/1809.11096v2","title":"Large Scale GAN Training for High Fidelity Natural Image Synthesis","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/ajbrock/BigGAN-PyTorch/blob/master/BigGANdeep.py","code_snippet_url_on_a_code_host":true,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Generative Adversarial Networks","url":"/methods/category/generative-adversarial-networks","pwc_aliases":[]},{"area":"Computer Vision","area_id":"computer-vision","collection":"Generative Models","url":"/methods/category/generative-models","pwc_aliases":[]}],"n_papers_tagged":11,"archive_num_papers":11,"papers_newest_first":[{"paper":"/paper/ultra-high-resolution-detector-simulation","slug":"ultra-high-resolution-detector-simulation","title":"Ultra-High-Resolution Detector Simulation with Intra-Event Aware GAN and Self-Supervised Relational Reasoning","date":"2023-03-07","arxiv_id":"2303.08046","n_code_links":1,"syntology":null},{"paper":null,"slug":"auditing-algorithmic-fairness-in-machine","title":"Auditing Algorithmic Fairness in Machine Learning for Health with Severity-Based LOGAN","date":"2022-11-16","arxiv_id":"2211.08742","n_code_links":0,"syntology":null},{"paper":"/paper/polarity-sampling-quality-and-diversity","slug":"polarity-sampling-quality-and-diversity","title":"Polarity Sampling: Quality and Diversity Control of Pre-Trained Generative Networks via Singular Values","date":"2022-03-03","arxiv_id":"2203.01993","n_code_links":1,"syntology":null},{"paper":null,"slug":"sinogram-denoise-based-on-generative","title":"Sinogram Denoise Based on Generative Adversarial Networks","date":"2021-08-09","arxiv_id":"2108.03903","n_code_links":0,"syntology":null},{"paper":null,"slug":"direct-reconstruction-of-linear-parametric","title":"Direct Reconstruction of Linear Parametric Images from Dynamic PET Using Nonlocal Deep Image Prior","date":"2021-06-18","arxiv_id":"2106.10359","n_code_links":0,"syntology":null},{"paper":"/paper/cascaded-diffusion-models-for-high-fidelity","slug":"cascaded-diffusion-models-for-high-fidelity","title":"Cascaded Diffusion Models for High Fidelity Image Generation","date":"2021-05-30","arxiv_id":"2106.15282","n_code_links":0,"syntology":null},{"paper":"/paper/a-geometric-analysis-of-deep-generative-image","slug":"a-geometric-analysis-of-deep-generative-image","title":"A Geometric Analysis of Deep Generative Image Models and Its Applications","date":"2021-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/logan-local-group-bias-detection-by","slug":"logan-local-group-bias-detection-by","title":"LOGAN: Local Group Bias Detection by Clustering","date":"2020-10-06","arxiv_id":"2010.02867","n_code_links":1,"syntology":null},{"paper":null,"slug":"allpass-feedback-delay-networks","title":"Allpass Feedback Delay Networks","date":"2020-07-14","arxiv_id":"2007.07337","n_code_links":0,"syntology":null},{"paper":"/paper/logan-latent-optimisation-for-generative-1","slug":"logan-latent-optimisation-for-generative-1","title":"LOGAN: Latent Optimisation for Generative Adversarial Networks","date":"2019-12-02","arxiv_id":"1912.00953","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":2,"n_instrument":3,"unverified":3,"pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/large-scale-gan-training-for-high-fidelity","slug":"large-scale-gan-training-for-high-fidelity","title":"Large Scale GAN Training for High Fidelity Natural Image Synthesis","date":"2018-09-28","arxiv_id":"1809.11096","n_code_links":35,"syntology":{"ran":28,"of":41,"n_ran_checked":14,"n_instrument":14,"unverified":13,"pointer_only":14,"phrase":"28 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 3 violated, 10 with no contract checked; 14 where Syntology's instrument failed) · 13 unverified","official":null}}],"papers_shown":11,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":11,"with_a_code_link":6,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":11,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/biggan-deep/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/biggan-deep/papers/ran/1","json":"/method/biggan-deep/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/image-generation","name":"Image Generation","papers":4},{"task":"/task/conditional-image-generation","name":"Conditional Image Generation","papers":3},{"task":"/task/bias-detection","name":"Bias Detection","papers":2},{"task":"/task/clustering","name":"Clustering","papers":2},{"task":"/task/high","name":"Vocal Bursts Intensity Prediction","papers":2},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":1},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/denoising","name":"Denoising","papers":1},{"task":"/task/density-estimation","name":"Density Estimation","papers":1},{"task":"/task/diversity","name":"Diversity","papers":1},{"task":"/task/fairness","name":"Fairness","papers":1},{"task":"/task/image-variation","name":"Image-Variation","papers":1},{"task":"/task/inductive-bias","name":"Inductive Bias","papers":1},{"task":"/task/metric-learning","name":"Metric Learning","papers":1},{"task":"/task/relational-reasoning","name":"Relational Reasoning","papers":1},{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":1},{"task":"/task/super-resolution","name":"Super-Resolution","papers":1},{"task":"/task/unconditional-image-generation","name":"Unconditional Image Generation","papers":1}],"tasks_shown":19,"n_tasks":19,"usage_by_year":[{"year":"2018","papers":1},{"year":"2019","papers":1},{"year":"2020","papers":2},{"year":"2021","papers":4},{"year":"2022","papers":2},{"year":"2023","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/biggan-deep"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=BigGAN-deep","read_at":"2026-10-05T00:53:09+00:00","query":"BigGAN-deep","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1809.11096","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'BigGAN-deep' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"3cbfc01244763107bce987674b8eed6a13807bb0f05867f523d85f9cd018d962","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}