{"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/first-order-generative-adversarial-networks","title":"First Order Generative Adversarial Networks","arxiv_id":"1802.04591","date":"2018-02-13","proceeding":"ICML 2018 7","authors":["Calvin Seward","Thomas Unterthiner","Urs Bergmann","Nikolay Jetchev","Sepp Hochreiter"],"abstract":"GANs excel at learning high dimensional distributions, but they can update\ngenerator parameters in directions that do not correspond to the steepest\ndescent direction of the objective. Prominent examples of problematic update\ndirections include those used in both Goodfellow's original GAN and the\nWGAN-GP. To formally describe an optimal update direction, we introduce a\ntheoretical framework which allows the derivation of requirements on both the\ndivergence and corresponding method for determining an update direction, with\nthese requirements guaranteeing unbiased mini-batch updates in the direction of\nsteepest descent. We propose a novel divergence which approximates the\nWasserstein distance while regularizing the critic's first order information.\nTogether with an accompanying update direction, this divergence fulfills the\nrequirements for unbiased steepest descent updates. We verify our method, the\nFirst Order GAN, with image generation on CelebA, LSUN and CIFAR-10 and set a\nnew state of the art on the One Billion Word language generation task. Code to\nreproduce experiments is available.","url_abs":"http://arxiv.org/abs/1802.04591v2","url_pdf":"http://arxiv.org/pdf/1802.04591v2.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":"first-order-generative-adversarial-networks","repo_url":"https://github.com/zalandoresearch/first_order_gan","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"image-generation","task_name":"Image Generation"},{"task_slug":"text-generation","task_name":"Text Generation"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-generation-on-cifar-10","task":"Image Generation","dataset":"CIFAR-10","model":"FOGAN","rank_in_archive_order":66,"of":78,"metrics":{"FID":"27.4"},"uses_additional_data":false},{"leaderboard":"/sota/image-generation-on-lsun-bedroom-64-x-64","task":"Image Generation","dataset":"LSUN Bedroom 64 x 64","model":"FOGAN","rank_in_archive_order":3,"of":3,"metrics":{"FID":"11.4"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"zalandoresearch/first_order_gan","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"14247b453d65385fc011639075ae259e6d47ebbba7ac52933a20231e12b6cbdf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}