Efficient Certified Reasoning for Binarized Neural Networks

Page view(s)
0
Checked on
Efficient Certified Reasoning for Binarized Neural Networks
Title:
Efficient Certified Reasoning for Binarized Neural Networks
Journal Title:
International Conference on Theory and Applications of Satisfiability Testing (SAT)
Publication Date:
07 August 2025
Citation:
Jiong Yang, Yong Kiam Tan, Mate Soos, Magnus O. Myreen, and Kuldeep S. Meel. Efficient Certified Reasoning for Binarized Neural Networks. In 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 341, pp. 32:1-32:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SAT.2025.32
Abstract:
Neural networks have emerged as essential components in safety-critical applications - these use cases demand complex, yet trustworthy computations. Binarized Neural Networks (BNNs) are a type of neural network where each neuron is constrained to a Boolean value; they are particularly well-suited for safety-critical tasks because they retain much of the computational capacities of full-scale (floating-point or quantized) deep neural networks, but remain compatible with satisfiability solvers for qualitative verification and with model counters for quantitative reasoning. However, existing methods for BNN analysis suffer from either limited scalability or susceptibility to soundness errors, which hinders their applicability in real-world scenarios. In this work, we present a scalable and trustworthy approach for both qualitative and quantitative verification of BNNs. Our approach introduces a native representation of BNN constraints in a custom-designed solver for qualitative reasoning, and in an approximate model counter for quantitative reasoning. We further develop specialized proof generation and checking pipelines with native support for BNN constraint reasoning, ensuring trustworthiness for all of our verification results. Empirical evaluations on a BNN robustness verification benchmark suite demonstrate that our certified solving approach achieves a 9× speedup over prior certified CNF and PB-based approaches, and our certified counting approach achieves a 218× speedup over the existing CNF-based baseline. In terms of coverage, our pipeline produces fully certified results for 99% and 86% of the qualitative and quantitative reasoning queries on BNNs, respectively. This is in sharp contrast to the best existing baselines which can fully certify only 62% and 4% of the queries, respectively.
License type:
Attribution 4.0 International (CC BY 4.0)
Funding Info:
This research / project is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) - funding reference [RGPIN-2024-05956]
Grant Reference no. : funding reference [RGPIN-2024-05956]

This research / project is supported by the National Research Foundation - Singapore NRF Fellowship Programme
Grant Reference no. : NRF-NRFF16-2024-0002

This research / project is supported by the Swedish Research Council - grant 2021-05165
Grant Reference no. : grant 2021-05165
Description:
© Jiong Yang, Yong Kiam Tan, Mate Soos, Magnus O. Myreen, and Kuldeep S. Meel; licensed under Creative Commons License CC-BY 4.028th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)
ISBN: