An Automata-Theoretic Approach to Synthesizing Binarized Neural Networks
Ye Tao, Wanwei Liu, Fu Song, Zhen Liang, Ji Wang, Hongxu Zhu

TL;DR
This paper introduces an automata-theoretic method for synthesizing binarized neural networks (BNNs) that satisfy specific properties, enhancing fairness and robustness while controlling network parameters.
Contribution
It proposes a novel automata-based synthesis framework for BNNs using a new temporal logic, BLTL, and SMT solvers, addressing interpretability and property verification.
Findings
Improves fairness and robustness of BNNs
Maintains high accuracy in synthesized networks
Provides a method to determine hyper-parameters before training
Abstract
Deep neural networks, (DNNs, a.k.a. NNs), have been widely used in various tasks and have been proven to be successful. However, the accompanied expensive computing and storage costs make the deployments in resource-constrained devices a significant concern. To solve this issue, quantization has emerged as an effective way to reduce the costs of DNNs with little accuracy degradation by quantizing floating-point numbers to low-width fixed-point representations. Quantized neural networks (QNNs) have been developed, with binarized neural networks (BNNs) restricted to binary values as a special case. Another concern about neural networks is their vulnerability and lack of interpretability. Despite the active research on trustworthy of DNNs, few approaches have been proposed to QNNs. To this end, this paper presents an automata-theoretic approach to synthesizing BNNs that meet designated…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFerroelectric and Negative Capacitance Devices · Advanced Memory and Neural Computing · Adversarial Robustness in Machine Learning
