{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/a-score-and-search-approach-to-learning","title":"A Score-and-Search Approach to Learning Bayesian Networks with Noisy-OR Relations","arxiv_id":"2011.01444","date":"2020-11-03","proceeding":null,"authors":["Charupriya Sharma","Zhenyu A. Liao","James Cussens","Peter van Beek"],"abstract":"A Bayesian network is a probabilistic graphical model that consists of a directed acyclic graph (DAG), where each node is a random variable and attached to each node is a conditional probability distribution (CPD). A Bayesian network can be learned from data using the well-known score-and-search approach, and within this approach a key consideration is how to simultaneously learn the global structure in the form of the underlying DAG and the local structure in the CPDs. Several useful forms of local structure have been identified in the literature but thus far the score-and-search approach has only been extended to handle local structure in form of context-specific independence. In this paper, we show how to extend the score-and-search approach to the important and widely useful case of noisy-OR relations. We provide an effective gradient descent algorithm to score a candidate noisy-OR using the widely used BIC score and we provide pruning rules that allow the search to successfully scale to medium sized networks. Our empirical results provide evidence for the success of our approach to learning Bayesian networks that incorporate noisy-OR relations.","url_abs":"https://arxiv.org/abs/2011.01444v1","url_pdf":"https://arxiv.org/pdf/2011.01444v1.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-score-and-search-approach-to-learning","repo_url":"https://github.com/CharupriyaSharma/eBNSLNoisyOR","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2011.01444","atlas_url":"https://app.syntology.ai/?focus=2011.01444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01444"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/CharupriyaSharma/eBNSLNoisyOR","reach":null}],"summary":{"ran_fixture":1,"ran_draft_wrong":1,"ran_violates":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"76ab0f9d6373b837","entry":"generateQOfX","repo":"CharupriyaSharma/eBNSLNoisyOR","repo_kind":"official","path":"NoisyORScore.py","file_url":"https://github.com/CharupriyaSharma/eBNSLNoisyOR/blob/HEAD/NoisyORScore.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"76ab0f9d6373b837"}},{"code_sha256_prefix":"26d6862177db6349","entry":"powerset","repo":"CharupriyaSharma/eBNSLNoisyOR","repo_kind":"official","path":"NoisyORScore.py","file_url":"https://github.com/CharupriyaSharma/eBNSLNoisyOR/blob/HEAD/NoisyORScore.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"26d6862177db6349"}},{"code_sha256_prefix":"f7f80e9d6e97774b","entry":"testFunction","repo":"CharupriyaSharma/eBNSLNoisyOR","repo_kind":"official","path":"NoisyORScore.py","file_url":"https://github.com/CharupriyaSharma/eBNSLNoisyOR/blob/HEAD/NoisyORScore.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"f7f80e9d6e97774b"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}