{"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/iterative-neural-autoregressive-distribution-1","title":"Iterative Neural Autoregressive Distribution Estimator (NADE-k)","arxiv_id":"1406.1485","date":"2014-06-05","proceeding":null,"authors":["Tapani Raiko","Li Yao","Kyunghyun Cho","Yoshua Bengio"],"abstract":"Training of the neural autoregressive density estimator (NADE) can be viewed\nas doing one step of probabilistic inference on missing values in data. We\npropose a new model that extends this inference scheme to multiple steps,\narguing that it is easier to learn to improve a reconstruction in $k$ steps\nrather than to learn to reconstruct in a single inference step. The proposed\nmodel is an unsupervised building block for deep learning that combines the\ndesirable properties of NADE and multi-predictive training: (1) Its test\nlikelihood can be computed analytically, (2) it is easy to generate independent\nsamples from it, and (3) it uses an inference engine that is a superset of\nvariational inference for Boltzmann machines. The proposed NADE-k is\ncompetitive with the state-of-the-art in density estimation on the two datasets\ntested.","url_abs":"http://arxiv.org/abs/1406.1485v3","url_pdf":"http://arxiv.org/pdf/1406.1485v3.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":"iterative-neural-autoregressive-distribution-1","repo_url":"https://github.com/yaoli/nade_k","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"density-estimation","task_name":"Density Estimation"},{"task_slug":"image-generation","task_name":"Image Generation"},{"task_slug":"missing-values","task_name":"Missing Values"},{"task_slug":"variational-inference","task_name":"Variational Inference"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-generation-on-binarized-mnist","task":"Image Generation","dataset":"Binarized MNIST","model":"EoNADE-5 2hl (128 orders)","rank_in_archive_order":7,"of":10,"metrics":{"nats":"84.68"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1406.1485","atlas_url":"https://app.syntology.ai/?focus=1406.1485","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":"1406.1485"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1406.1485\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1406.1485"},"call":"get_concepts_for_paper(arxiv_id=\"1406.1485\")"}],"by_repo":[{"repo":"yaoli/nade_k","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":"7a161e3c7211bc85e486c38c48cfa4c1db7f8f088257ca5f38c93077c30fa414","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}