Adversarial Robustness Certification for Bayesian Neural Networks
Matthew Wicker, Andrea Patane, Luca Laurenti, Marta Kwiatkowska

TL;DR
This paper introduces a unified framework for certifying the adversarial robustness of Bayesian neural networks, providing formal bounds on their probabilistic and decision robustness in various tasks.
Contribution
It presents a novel computational approach for efficiently bounding robustness properties of BNNs regardless of training method, enabling formal certification.
Findings
Effective robustness certification on diverse tasks
Applicable to large BNNs with various inference methods
Demonstrated robustness bounds on real-world benchmarks
Abstract
We study the problem of certifying the robustness of Bayesian neural networks (BNNs) to adversarial input perturbations. Given a compact set of input points and a set of output points , we define two notions of robustness for BNNs in an adversarial setting: probabilistic robustness and decision robustness. Probabilistic robustness is the probability that for all points in the output of a BNN sampled from the posterior is in . On the other hand, decision robustness considers the optimal decision of a BNN and checks if for all points in the optimal decision of the BNN for a given loss function lies within the output set . Although exact computation of these robustness properties is challenging due to the probabilistic and non-convex nature of BNNs, we present a unified computational framework for efficiently and formally…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Fault Detection and Control Systems · Bayesian Modeling and Causal Inference
