{"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":"/paper/unrolled-generative-adversarial-networks","title":"Unrolled Generative Adversarial Networks","arxiv_id":"1611.02163","date":"2016-11-07","proceeding":null,"authors":["Luke Metz","Ben Poole","David Pfau","Jascha Sohl-Dickstein"],"abstract":"We introduce a method to stabilize Generative Adversarial Networks (GANs) by\ndefining the generator objective with respect to an unrolled optimization of\nthe discriminator. This allows training to be adjusted between using the\noptimal discriminator in the generator's objective, which is ideal but\ninfeasible in practice, and using the current value of the discriminator, which\nis often unstable and leads to poor solutions. We show how this technique\nsolves the common problem of mode collapse, stabilizes training of GANs with\ncomplex recurrent generators, and increases diversity and coverage of the data\ndistribution by the generator.","url_abs":"http://arxiv.org/abs/1611.02163v4","url_pdf":"http://arxiv.org/pdf/1611.02163v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"unrolled-generative-adversarial-networks","repo_url":"https://github.com/poolio/unrolled_gan","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"unrolled-generative-adversarial-networks","repo_url":"https://github.com/MarisaKirisame/unroll_gan","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"unrolled-generative-adversarial-networks","repo_url":"https://github.com/alex98chen/testGAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"unrolled-generative-adversarial-networks","repo_url":"https://github.com/andrewliao11/unrolled-gans","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"unrolled-generative-adversarial-networks","repo_url":"https://github.com/apaszke/pytorch-dist","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"unrolled-generative-adversarial-networks","repo_url":"https://github.com/chameleonTK/continual-learning-for-HAR","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"unrolled-generative-adversarial-networks","repo_url":"https://github.com/locuslab/gradient_regularized_gan","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"unrolled-generative-adversarial-networks","repo_url":"https://github.com/lyken17/pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"unrolled-generative-adversarial-networks","repo_url":"https://github.com/mangoubi/Min-max-optimization-algorithm-for-training-GANs","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"}],"methods":[],"datasets_introduced":[{"slug":"stacked-mnist","name":"Stacked MNIST","full_name":"Stacked MNIST"}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1611.02163","atlas_url":"https://app.syntology.ai/?focus=1611.02163","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1611.02163"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1611.02163\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1611.02163"},"call":"get_concepts_for_paper(arxiv_id=\"1611.02163\")"}],"by_repo":[{"repo":"poolio/unrolled_gan","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MarisaKirisame/unroll_gan","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"alex98chen/testGAN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"andrewliao11/unrolled-gans","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"apaszke/pytorch-dist","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"chameleonTK/continual-learning-for-HAR","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"locuslab/gradient_regularized_gan","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"lyken17/pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mangoubi/Min-max-optimization-algorithm-for-training-GANs","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2006.12376"],"harvested_for_calls":[{"arxiv_id":"2006.12376","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.12376"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.12376\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"654d8f5256232bf00a11d30c7aa64029a4616554a8ea216e4c9131275cc04e08","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}