{"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/from-optimal-transport-to-generative-modeling","title":"From optimal transport to generative modeling: the VEGAN cookbook","arxiv_id":"1705.07642","date":"2017-05-22","proceeding":null,"authors":["Olivier Bousquet","Sylvain Gelly","Ilya Tolstikhin","Carl-Johann Simon-Gabriel","Bernhard Schoelkopf"],"abstract":"We study unsupervised generative modeling in terms of the optimal transport\n(OT) problem between true (but unknown) data distribution $P_X$ and the latent\nvariable model distribution $P_G$. We show that the OT problem can be\nequivalently written in terms of probabilistic encoders, which are constrained\nto match the posterior and prior distributions over the latent space. When\nrelaxed, this constrained optimization problem leads to a penalized optimal\ntransport (POT) objective, which can be efficiently minimized using stochastic\ngradient descent by sampling from $P_X$ and $P_G$. We show that POT for the\n2-Wasserstein distance coincides with the objective heuristically employed in\nadversarial auto-encoders (AAE) (Makhzani et al., 2016), which provides the\nfirst theoretical justification for AAEs known to the authors. We also compare\nPOT to other popular techniques like variational auto-encoders (VAE) (Kingma\nand Welling, 2014). Our theoretical results include (a) a better understanding\nof the commonly observed blurriness of images generated by VAEs, and (b)\nestablishing duality between Wasserstein GAN (Arjovsky and Bottou, 2017) and\nPOT for the 1-Wasserstein distance.","url_abs":"http://arxiv.org/abs/1705.07642v1","url_pdf":"http://arxiv.org/pdf/1705.07642v1.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":"from-optimal-transport-to-generative-modeling","repo_url":"https://github.com/zhenxuan00/graphical-gan","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.07642","atlas_url":"https://app.syntology.ai/?focus=1705.07642","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.07642"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.07642\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.07642"},"call":"get_concepts_for_paper(arxiv_id=\"1705.07642\")"}],"by_repo":[{"repo":"zhenxuan00/graphical-gan","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":"ac97a1df7dfd63169819459f7b3840c1075dc83113854f1e6ca1cdef9f03cf49","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}