{"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/a-deep-and-tractable-density-estimator","title":"A Deep and Tractable Density Estimator","arxiv_id":"1310.1757","date":"2013-10-07","proceeding":null,"authors":["Benigno Uria","Iain Murray","Hugo Larochelle"],"abstract":"The Neural Autoregressive Distribution Estimator (NADE) and its real-valued\nversion RNADE are competitive density models of multidimensional data across a\nvariety of domains. These models use a fixed, arbitrary ordering of the data\ndimensions. One can easily condition on variables at the beginning of the\nordering, and marginalize out variables at the end of the ordering, however\nother inference tasks require approximate inference. In this work we introduce\nan efficient procedure to simultaneously train a NADE model for each possible\nordering of the variables, by sharing parameters across all these models. We\ncan thus use the most convenient model for each inference task at hand, and\nensembles of such models with different orderings are immediately available.\nMoreover, unlike the original NADE, our training procedure scales to deep\nmodels. Empirically, ensembles of Deep NADE models obtain state of the art\ndensity estimation performance.","url_abs":"http://arxiv.org/abs/1310.1757v2","url_pdf":"http://arxiv.org/pdf/1310.1757v2.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":"a-deep-and-tractable-density-estimator","repo_url":"https://github.com/princetonlips/mam","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"density-estimation","task_name":"Density Estimation"},{"task_slug":"image-generation","task_name":"Image Generation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-generation-on-binarized-mnist","task":"Image Generation","dataset":"Binarized MNIST","model":"NADE","rank_in_archive_order":10,"of":10,"metrics":{"nats":"88.33"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1310.1757","atlas_url":"https://app.syntology.ai/?focus=1310.1757","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":"1310.1757"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1310.1757\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1310.1757"},"call":"get_concepts_for_paper(arxiv_id=\"1310.1757\")"}],"by_repo":[{"repo":"princetonlips/mam","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["2106.04399","2110.02037","2310.12920"],"harvested_for_calls":[{"arxiv_id":"2106.04399","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.04399"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.04399\")"},{"arxiv_id":"2110.02037","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.02037"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.02037\")"},{"arxiv_id":"2310.12920","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2310.12920"},"call":"get_harvested_code_for_paper(arxiv_id=\"2310.12920\")"}]}],"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":"1f08452d4b4d753e61600059884df6dde9e855479bb16d6e51f0f8e7663409c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}