{"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/pixelgan-autoencoders","title":"PixelGAN Autoencoders","arxiv_id":"1706.00531","date":"2017-06-02","proceeding":"NeurIPS 2017 12","authors":["Alireza Makhzani","Brendan Frey"],"abstract":"In this paper, we describe the \"PixelGAN autoencoder\", a generative\nautoencoder in which the generative path is a convolutional autoregressive\nneural network on pixels (PixelCNN) that is conditioned on a latent code, and\nthe recognition path uses a generative adversarial network (GAN) to impose a\nprior distribution on the latent code. We show that different priors result in\ndifferent decompositions of information between the latent code and the\nautoregressive decoder. For example, by imposing a Gaussian distribution as the\nprior, we can achieve a global vs. local decomposition, or by imposing a\ncategorical distribution as the prior, we can disentangle the style and content\ninformation of images in an unsupervised fashion. We further show how the\nPixelGAN autoencoder with a categorical prior can be directly used in\nsemi-supervised settings and achieve competitive semi-supervised classification\nresults on the MNIST, SVHN and NORB datasets.","url_abs":"http://arxiv.org/abs/1706.00531v1","url_pdf":"http://arxiv.org/pdf/1706.00531v1.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":"pixelgan-autoencoders","repo_url":"https://github.com/anonyme20/nips20","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":null,"task_name":"Generative Adversarial Network"},{"task_slug":"unsupervised-image-classification","task_name":"Unsupervised Image Classification"},{"task_slug":"unsupervised-mnist","task_name":"Unsupervised MNIST"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/unsupervised-image-classification-on-mnist","task":"Unsupervised Image Classification","dataset":"MNIST","model":"PixelGAN Autoencoders","rank_in_archive_order":10,"of":10,"metrics":{"Accuracy":"94.73"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.00531","atlas_url":"https://app.syntology.ai/?focus=1706.00531","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":"1706.00531"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.00531\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.00531"},"call":"get_concepts_for_paper(arxiv_id=\"1706.00531\")"}],"by_repo":[{"repo":"anonyme20/nips20","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":"7de59ae46f9f818512c01d81e0334e77210af104e08b59b6803695a1559132c1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}