{"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/tight-verification-of-probabilistic","title":"Tight Verification of Probabilistic Robustness in Bayesian Neural Networks","arxiv_id":"2401.11627","date":"2024-01-21","proceeding":null,"authors":["Ben Batten","Mehran Hosseini","Alessio Lomuscio"],"abstract":"We introduce two algorithms for computing tight guarantees on the probabilistic robustness of Bayesian Neural Networks (BNNs). Computing robustness guarantees for BNNs is a significantly more challenging task than verifying the robustness of standard Neural Networks (NNs) because it requires searching the parameters' space for safe weights. Moreover, tight and complete approaches for the verification of standard NNs, such as those based on Mixed-Integer Linear Programming (MILP), cannot be directly used for the verification of BNNs because of the polynomial terms resulting from the consecutive multiplication of variables encoding the weights. Our algorithms efficiently and effectively search the parameters' space for safe weights by using iterative expansion and the network's gradient and can be used with any verification algorithm of choice for BNNs. In addition to proving that our algorithms compute tighter bounds than the SoA, we also evaluate our algorithms against the SoA on standard benchmarks, such as MNIST and CIFAR10, showing that our algorithms compute bounds up to 40% tighter than the SoA.","url_abs":"https://arxiv.org/abs/2401.11627v2","url_pdf":"https://arxiv.org/pdf/2401.11627v2.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":"tight-verification-of-probabilistic","repo_url":"https://github.com/benbatten/TightVerificationOfProbabilisticRobustnessInBNNs","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2401.11627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.11627"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+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/benbatten/TightVerificationOfProbabilisticRobustnessInBNNs","reach":{"status":"ok"}}],"summary":{"ran":4,"ran_honours":1,"unverified":1},"by_repo_kind":{"official":{"samples":6,"ran":5,"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":6,"samples":[{"code_sha256_prefix":"6e5fd8602056b0ba","entry":"compute_erf_prob","repo":"benbatten/TightVerificationOfProbabilisticRobustnessInBNNs","repo_kind":"official","path":"verifier/ProbabilisticReachability.py","file_url":"https://github.com/benbatten/TightVerificationOfProbabilisticRobustnessInBNNs/blob/HEAD/verifier/ProbabilisticReachability.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6e5fd8602056b0ba"}},{"code_sha256_prefix":"1b76c5518f4f1b62","entry":"interval_matrix_product","repo":"benbatten/TightVerificationOfProbabilisticRobustnessInBNNs","repo_kind":"official","path":"verifier/utils.py","file_url":"https://github.com/benbatten/TightVerificationOfProbabilisticRobustnessInBNNs/blob/HEAD/verifier/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"1b76c5518f4f1b62"}},{"code_sha256_prefix":"051965c20039f221","entry":"overlap_interval","repo":"benbatten/TightVerificationOfProbabilisticRobustnessInBNNs","repo_kind":"official","path":"verifier/utils.py","file_url":"https://github.com/benbatten/TightVerificationOfProbabilisticRobustnessInBNNs/blob/HEAD/verifier/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"051965c20039f221"}},{"code_sha256_prefix":"5af8fa537914ff3d","entry":"relu","repo":"benbatten/TightVerificationOfProbabilisticRobustnessInBNNs","repo_kind":"official","path":"verifier/utils.py","file_url":"https://github.com/benbatten/TightVerificationOfProbabilisticRobustnessInBNNs/blob/HEAD/verifier/utils.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"5af8fa537914ff3d"}},{"code_sha256_prefix":"0947ff8c53e89961","entry":"tf_model_builder","repo":"benbatten/TightVerificationOfProbabilisticRobustnessInBNNs","repo_kind":"official","path":"verifier/ProbabilisticReachability.py","file_url":"https://github.com/benbatten/TightVerificationOfProbabilisticRobustnessInBNNs/blob/HEAD/verifier/ProbabilisticReachability.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"0947ff8c53e89961"}},{"code_sha256_prefix":"aeeb7adef366d7ae","entry":"compute_gradient","repo":"benbatten/TightVerificationOfProbabilisticRobustnessInBNNs","repo_kind":"official","path":"verifier/ProbabilisticReachability.py","file_url":"https://github.com/benbatten/TightVerificationOfProbabilisticRobustnessInBNNs/blob/HEAD/verifier/ProbabilisticReachability.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"aeeb7adef366d7ae"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}