{"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/generating-multi-categorical-samples-with","title":"Generating Multi-Categorical Samples with Generative Adversarial Networks","arxiv_id":"1807.01202","date":"2018-07-03","proceeding":null,"authors":["Ramiro Camino","Christian Hammerschmidt","Radu State"],"abstract":"We propose a method to train generative adversarial networks on mutivariate\nfeature vectors representing multiple categorical values. In contrast to the\ncontinuous domain, where GAN-based methods have delivered considerable results,\nGANs struggle to perform equally well on discrete data. We propose and compare\nseveral architectures based on multiple (Gumbel) softmax output layers taking\ninto account the structure of the data. We evaluate the performance of our\narchitecture on datasets with different sparsity, number of features, ranges of\ncategorical values, and dependencies among the features. Our proposed\narchitecture and method outperforms existing models.","url_abs":"http://arxiv.org/abs/1807.01202v2","url_pdf":"http://arxiv.org/pdf/1807.01202v2.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":"generating-multi-categorical-samples-with","repo_url":"https://github.com/rcamino/multi-categorical-gans","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"generating-multi-categorical-samples-with","repo_url":"https://github.com/ydataai/ydata-synthetic","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[],"methods":[{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"rcamino/multi-categorical-gans","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ydataai/ydata-synthetic","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\")"}]}],"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":"dbfd7f74dd47cfdf16f95e85c4dae8b4bdb17fd08ed4b2a376e7aa53de237324","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}