{"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/parallel-multiscale-autoregressive-density","title":"Parallel Multiscale Autoregressive Density Estimation","arxiv_id":"1703.03664","date":"2017-03-10","proceeding":"ICML 2017 8","authors":["Scott Reed","Aäron van den Oord","Nal Kalchbrenner","Sergio Gómez Colmenarejo","Ziyu Wang","Dan Belov","Nando de Freitas"],"abstract":"PixelCNN achieves state-of-the-art results in density estimation for natural\nimages. Although training is fast, inference is costly, requiring one network\nevaluation per pixel; O(N) for N pixels. This can be sped up by caching\nactivations, but still involves generating each pixel sequentially. In this\nwork, we propose a parallelized PixelCNN that allows more efficient inference\nby modeling certain pixel groups as conditionally independent. Our new PixelCNN\nmodel achieves competitive density estimation and orders of magnitude speedup -\nO(log N) sampling instead of O(N) - enabling the practical generation of\n512x512 images. We evaluate the model on class-conditional image generation,\ntext-to-image synthesis, and action-conditional video generation, showing that\nour model achieves the best results among non-pixel-autoregressive density\nmodels that allow efficient sampling.","url_abs":"http://arxiv.org/abs/1703.03664v1","url_pdf":"http://arxiv.org/pdf/1703.03664v1.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":[],"tasks":[{"task_slug":"conditional-image-generation","task_name":"Conditional Image Generation"},{"task_slug":"density-estimation","task_name":"Density Estimation"},{"task_slug":"image-compression","task_name":"Image Compression"},{"task_slug":"image-generation","task_name":"Image Generation"},{"task_slug":"video-generation","task_name":"Video Generation"}],"methods":[{"method_slug":"pixelcnn","method_name":"PixelCNN"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-compression-on-imagenet32","task":"Image Compression","dataset":"ImageNet32","model":"MS-PixelCNN","rank_in_archive_order":2,"of":5,"metrics":{"bpsp":"3.95"},"uses_additional_data":false},{"leaderboard":"/sota/image-generation-on-imagenet-64x64","task":"Image Generation","dataset":"ImageNet 64x64","model":"Parallel Multiscale","rank_in_archive_order":54,"of":65,"metrics":{"Bits per dim":"3.7"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.03664","atlas_url":"https://app.syntology.ai/?focus=1703.03664","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":"1703.03664"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.03664\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.03664"},"call":"get_concepts_for_paper(arxiv_id=\"1703.03664\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2d112c15565e887ee5ac38e86237ace4dd8717c4a7e6f632c25b02c9e8e156a3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}