{"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/predicting-distributions-with-linearizing","title":"Predicting distributions with Linearizing Belief Networks","arxiv_id":"1511.05622","date":"2015-11-17","proceeding":null,"authors":["Yann N. Dauphin","David Grangier"],"abstract":"Conditional belief networks introduce stochastic binary variables in neural\nnetworks. Contrary to a classical neural network, a belief network can predict\nmore than the expected value of the output $Y$ given the input $X$. It can\npredict a distribution of outputs $Y$ which is useful when an input can admit\nmultiple outputs whose average is not necessarily a valid answer. Such networks\nare particularly relevant to inverse problems such as image prediction for\ndenoising, or text to speech. However, traditional sigmoid belief networks are\nhard to train and are not suited to continuous problems. This work introduces a\nnew family of networks called linearizing belief nets or LBNs. A LBN decomposes\ninto a deep linear network where each linear unit can be turned on or off by\nnon-deterministic binary latent units. It is a universal approximator of\nreal-valued conditional distributions and can be trained using gradient\ndescent. Moreover, the linear pathways efficiently propagate continuous\ninformation and they act as multiplicative skip-connections that help\noptimization by removing gradient diffusion. This yields a model which trains\nefficiently and improves the state-of-the-art on image denoising and facial\nexpression generation with the Toronto faces dataset.","url_abs":"http://arxiv.org/abs/1511.05622v4","url_pdf":"http://arxiv.org/pdf/1511.05622v4.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":"predicting-distributions-with-linearizing","repo_url":"https://github.com/hazdzz/BGU","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"facial-expression-generation","task_name":"Facial expression generation"},{"task_slug":"image-denoising","task_name":"Image Denoising"},{"task_slug":"text-to-speech","task_name":"Text to Speech"},{"task_slug":"text-to-speech-1","task_name":"text-to-speech"},{"task_slug":null,"task_name":"valid"}],"methods":[],"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":"hazdzz/BGU","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":"ad7c49b81e5536517b045e852587ddf6516367bb9412f1a8b48cde5020922961","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}