{"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-modeling-using-the-sliced","title":"Generative Modeling using the Sliced Wasserstein Distance","arxiv_id":"1803.11188","date":"2018-03-29","proceeding":"CVPR 2018 6","authors":["Ishan Deshpande","Ziyu Zhang","Alexander Schwing"],"abstract":"Generative Adversarial Nets (GANs) are very successful at modeling\ndistributions from given samples, even in the high-dimensional case. However,\ntheir formulation is also known to be hard to optimize and often not stable.\nWhile this is particularly true for early GAN formulations, there has been\nsignificant empirically motivated and theoretically founded progress to improve\nstability, for instance, by using the Wasserstein distance rather than the\nJenson-Shannon divergence. Here, we consider an alternative formulation for\ngenerative modeling based on random projections which, in its simplest form,\nresults in a single objective rather than a saddle-point formulation. By\naugmenting this approach with a discriminator we improve its accuracy. We found\nour approach to be significantly more stable compared to even the improved\nWasserstein GAN. Further, unlike the traditional GAN loss, the loss formulated\nin our method is a good measure of the actual distance between the\ndistributions and, for the first time for GAN training, we are able to show\nestimates for the same.","url_abs":"http://arxiv.org/abs/1803.11188v1","url_pdf":"http://arxiv.org/pdf/1803.11188v1.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-modeling-using-the-sliced","repo_url":"https://github.com/ishansd/swg","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1803.11188","atlas_url":"https://app.syntology.ai/?focus=1803.11188","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":"1803.11188"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1803.11188\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1803.11188"},"call":"get_concepts_for_paper(arxiv_id=\"1803.11188\")"}],"by_repo":[{"repo":"ishansd/swg","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":"ae30b863a27a77eb1c248163d25d0e69c1773cc3377945bd6f2a3d5489b920e4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}