{"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/connectionist-learning-of-belief-networks","title":"Connectionist Learning of Belief Networks","arxiv_id":null,"date":"1992-06-01","proceeding":null,"authors":["Radford M. Neal"],"abstract":"Connectionist learning procedures are presented for \"sigmoid\" and \"noisy-OR\" varieties\r\nof probabilistic belief networks. These networks have previously been seen primarily as a\r\nmeans of representing knowledge derived from experts. Here it is shown that the \"Gibbs\r\nsampling\" simulation procedure for such networks can support maximum-likelihood\r\nlearning from empirical data through local gradient ascent. This learning procedure\r\nresembles that used for \"Boltzmann machines\", and like it, allows the use of \"hidden\"\r\nvariables to model correlations between visible variables. Due to the directed nature\r\nof the connections in a belief network, however, the \"negative phase\" of Boltzmann\r\nmachine learning is unnecessary. Experimental results show that, as a result, learning in\r\na sigmoid belief network can be faster than in a Boltzmann machine. These networks\r\nhave other advantages over Boltzmann machines in pattern classification and decision\r\nmaking applications, are naturally applicable to unsupervised learning problems, and\r\nprovide a link between work on connectionist learning and work on the representation\r\nof expert knowledge.","url_abs":"https://www.semanticscholar.org/paper/Connectionist-Learning-of-Belief-Networks-Neal/a120c05ad7cd4ce2eb8fb9697e16c7c4877208a5","url_pdf":"http://www.cs.toronto.edu/~bonner/courses/2016s/csc321/readings/Connectionist%20learning%20of%20belief%20networks.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":"connectionist-learning-of-belief-networks","repo_url":"https://github.com/EugenHotaj/pytorch-generative/blob/master/pytorch_generative/models/autoregressive/fvbn.py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"EugenHotaj/pytorch-generative","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["1502.03509","1605.02226","1606.05328","1712.09763","1906.00446","2011.10650"],"harvested_for_calls":[{"arxiv_id":"1502.03509","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1502.03509"},"call":"get_harvested_code_for_paper(arxiv_id=\"1502.03509\")"},{"arxiv_id":"1605.02226","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1605.02226"},"call":"get_harvested_code_for_paper(arxiv_id=\"1605.02226\")"},{"arxiv_id":"1606.05328","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1606.05328"},"call":"get_harvested_code_for_paper(arxiv_id=\"1606.05328\")"},{"arxiv_id":"1712.09763","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1712.09763"},"call":"get_harvested_code_for_paper(arxiv_id=\"1712.09763\")"},{"arxiv_id":"1906.00446","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1906.00446"},"call":"get_harvested_code_for_paper(arxiv_id=\"1906.00446\")"},{"arxiv_id":"2011.10650","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2011.10650"},"call":"get_harvested_code_for_paper(arxiv_id=\"2011.10650\")"}]}],"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":"a87e4ed739b65cc3363e8cb2f49233aef146a8e510c988a1e3d5e3761d905e94","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}