{"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/gan-qp-a-novel-gan-framework-without-gradient","title":"GAN-QP: A Novel GAN Framework without Gradient Vanishing and Lipschitz Constraint","arxiv_id":"1811.07296","date":"2018-11-18","proceeding":null,"authors":["Jianlin Su"],"abstract":"We know SGAN may have a risk of gradient vanishing. A significant improvement\nis WGAN, with the help of 1-Lipschitz constraint on discriminator to prevent\nfrom gradient vanishing. Is there any GAN having no gradient vanishing and no\n1-Lipschitz constraint on discriminator? We do find one, called GAN-QP.\n  To construct a new framework of Generative Adversarial Network (GAN) usually\nincludes three steps: 1. choose a probability divergence; 2. convert it into a\ndual form; 3. play a min-max game. In this articles, we demonstrate that the\nfirst step is not necessary. We can analyse the property of divergence and even\nconstruct new divergence in dual space directly. As a reward, we obtain a\nsimpler alternative of WGAN: GAN-QP. We demonstrate that GAN-QP have a better\nperformance than WGAN in theory and practice.","url_abs":"http://arxiv.org/abs/1811.07296v4","url_pdf":"http://arxiv.org/pdf/1811.07296v4.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":"gan-qp-a-novel-gan-framework-without-gradient","repo_url":"https://github.com/bojone/gan-qp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"gan-qp-a-novel-gan-framework-without-gradient","repo_url":"https://github.com/One-sixth/gan-qp-mod-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"gan-qp-a-novel-gan-framework-without-gradient","repo_url":"https://github.com/createamind/VDB-GAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"gan-qp-a-novel-gan-framework-without-gradient","repo_url":"https://github.com/rahulbhalley/gan-qp.pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"articles","task_name":"Articles"},{"task_slug":null,"task_name":"Generative Adversarial Network"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"wgan","method_name":"WGAN"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.07296","atlas_url":"https://app.syntology.ai/?focus=1811.07296","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":"1811.07296"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.07296\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.07296"},"call":"get_concepts_for_paper(arxiv_id=\"1811.07296\")"}],"by_repo":[{"repo":"bojone/gan-qp","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"One-sixth/gan-qp-mod-pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"createamind/VDB-GAN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"rahulbhalley/gan-qp.pytorch","kind":"listed","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":"3d23d529c19ce1f05721f739321ee6325d917ffaac757a3b5eb3355adb670389","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}