{"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/generative-adversarial-networks-an-overview","title":"Generative Adversarial Networks: An Overview","arxiv_id":"1710.07035","date":"2017-10-19","proceeding":null,"authors":["Antonia Creswell","Tom White","Vincent Dumoulin","Kai Arulkumaran","Biswa Sengupta","Anil A. Bharath"],"abstract":"Generative adversarial networks (GANs) provide a way to learn deep\nrepresentations without extensively annotated training data. They achieve this\nthrough deriving backpropagation signals through a competitive process\ninvolving a pair of networks. The representations that can be learned by GANs\nmay be used in a variety of applications, including image synthesis, semantic\nimage editing, style transfer, image super-resolution and classification. The\naim of this review paper is to provide an overview of GANs for the signal\nprocessing community, drawing on familiar analogies and concepts where\npossible. In addition to identifying different methods for training and\nconstructing GANs, we also point to remaining challenges in their theory and\napplication.","url_abs":"http://arxiv.org/abs/1710.07035v1","url_pdf":"http://arxiv.org/pdf/1710.07035v1.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":"generative-adversarial-networks-an-overview","repo_url":"https://github.com/NicicDamjan/SoftKompjuting","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"generative-adversarial-networks-an-overview","repo_url":"https://github.com/ShutoAraki/EverybodyDanceNow-Temporal-FaceGAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"generative-adversarial-networks-an-overview","repo_url":"https://github.com/mshaikh2/GANs_Comparison","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"image-generation","task_name":"Image Generation"},{"task_slug":"image-super-resolution","task_name":"Image Super-Resolution"},{"task_slug":"style-transfer","task_name":"Style Transfer"},{"task_slug":"super-resolution","task_name":"Super-Resolution"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1710.07035","atlas_url":"https://app.syntology.ai/?focus=1710.07035","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":"1710.07035"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1710.07035\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1710.07035"},"call":"get_concepts_for_paper(arxiv_id=\"1710.07035\")"}],"by_repo":[{"repo":"NicicDamjan/SoftKompjuting","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1511.06434"],"harvested_for_calls":[{"arxiv_id":"1511.06434","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1511.06434"},"call":"get_harvested_code_for_paper(arxiv_id=\"1511.06434\")"}]},{"repo":"ShutoAraki/EverybodyDanceNow-Temporal-FaceGAN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1808.07371"],"harvested_for_calls":[{"arxiv_id":"1808.07371","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1808.07371"},"call":"get_harvested_code_for_paper(arxiv_id=\"1808.07371\")"}]},{"repo":"mshaikh2/GANs_Comparison","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1710.09829"],"harvested_for_calls":[{"arxiv_id":"1710.09829","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1710.09829"},"call":"get_harvested_code_for_paper(arxiv_id=\"1710.09829\")"}]}],"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":"27005d50e4b69cbfbcbe63f0e3084d19058ebd4b20d68d240ce9c87eeb3dae58","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}