{"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/geometric-gan","title":"Geometric GAN","arxiv_id":"1705.02894","date":"2017-05-08","proceeding":null,"authors":["Jae Hyun Lim","Jong Chul Ye"],"abstract":"Generative Adversarial Nets (GANs) represent an important milestone for\neffective generative models, which has inspired numerous variants seemingly\ndifferent from each other. One of the main contributions of this paper is to\nreveal a unified geometric structure in GAN and its variants. Specifically, we\nshow that the adversarial generative model training can be decomposed into\nthree geometric steps: separating hyperplane search, discriminator parameter\nupdate away from the separating hyperplane, and the generator update along the\nnormal vector direction of the separating hyperplane. This geometric intuition\nreveals the limitations of the existing approaches and leads us to propose a\nnew formulation called geometric GAN using SVM separating hyperplane that\nmaximizes the margin. Our theoretical analysis shows that the geometric GAN\nconverges to a Nash equilibrium between the discriminator and generator. In\naddition, extensive numerical results show that the superior performance of\ngeometric GAN.","url_abs":"http://arxiv.org/abs/1705.02894v2","url_pdf":"http://arxiv.org/pdf/1705.02894v2.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":"geometric-gan","repo_url":"https://github.com/WangZesen/GAN-Hinge-Loss","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"geometric-gan","repo_url":"https://github.com/WangZesen/Spectral-Normalization-GAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"geometric-gan","repo_url":"https://github.com/beresandras/gan-flavours-keras","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"geometric-gan","repo_url":"https://github.com/ChristophReich1996/Dirac-GAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"geometric-gan","repo_url":"https://github.com/ChristophReich1996/Mode_Collapse","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"geometric-gan","repo_url":"https://github.com/open-mmlab/mmgeneration","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"text-generation","task_name":"Text Generation"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"gan-hinge-loss","method_name":"GAN Hinge Loss"},{"method_slug":"svm","method_name":"SVM"}],"datasets_introduced":[],"methods_introduced":[{"slug":"gan-hinge-loss","name":"GAN Hinge Loss","full_name":"GAN Hinge Loss"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.02894","atlas_url":"https://app.syntology.ai/?focus=1705.02894","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":"1705.02894"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.02894\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.02894"},"call":"get_concepts_for_paper(arxiv_id=\"1705.02894\")"}],"by_repo":[{"repo":"WangZesen/GAN-Hinge-Loss","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"WangZesen/Spectral-Normalization-GAN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1802.05957"],"harvested_for_calls":[{"arxiv_id":"1802.05957","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.05957"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.05957\")"}]},{"repo":"beresandras/gan-flavours-keras","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2006.06676"],"harvested_for_calls":[{"arxiv_id":"2006.06676","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.06676"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.06676\")"}]},{"repo":"ChristophReich1996/Dirac-GAN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1704.00028"],"harvested_for_calls":[{"arxiv_id":"1704.00028","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1704.00028"},"call":"get_harvested_code_for_paper(arxiv_id=\"1704.00028\")"}]},{"repo":"ChristophReich1996/Mode_Collapse","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1704.00028"],"harvested_for_calls":[{"arxiv_id":"1704.00028","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1704.00028"},"call":"get_harvested_code_for_paper(arxiv_id=\"1704.00028\")"}]},{"repo":"open-mmlab/mmgeneration","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"4b135bd09f5ed4da8143d0dab8526854d6688beb6ae1f3ffa3e35189ce897c6e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}