Tightening Robustness Verification of Convolutional Neural Networks with Fine-Grained Linear Approximation
Yiting Wu, Min Zhang
Abstract
The robustness of neural networks can be quantitatively indicated by a lower bound within which any perturbation does not alter the original input’s classification result. A certified lower bound is also a criterion to evaluate the performance of robustness verification approaches. In this paper, we present a tighter linear approximation approach for the robustness verification of Convolutional Neural Networks (CNNs). By the tighter approximation, we can tighten the robustness verification of CNNs, i.e., proving they are robust within a larger 10 perturbation distance. Furthermore, our approach is applicable to general sigmoid-like activation functions. We implement DeepCert, the resulting verification toolkit. We evaluate it with open-source benchmarks, including LeNet and the models trained on MNIST and CIFAR. Experimental results show that DeepCert outperforms other state-of-the-art robustness verification tools with at most 286.28% improvement to the certified lower bound and 1566.76 times speedup for the same neural networks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0ce97811-9e41-49bb-bd2f-3bc324215ba4Cited by top-tier papers7
- Provably Tightest Linear Approximation for Robustness Verification of Sigmoid-like Neural NetworksZhaodi Zhang, Yiting Wu, Si Liu, Jing Liu et al.ASE 2022 · 11 citations
- A Tale of Two Approximations: Tightening Over-Approximation for DNN Robustness Verification via Under-ApproximationZhiyi Xue, Si Liu, Zhaodi Zhang, Yiting Wu et al.ISSTA 2023 · 5 citations
- SOL: Sampling-based Optimal Linear bounding of arbitrary scalar functionsYuriy Biktairov, Jyotirmoy DeshmukhNeurIPS 2023 · 3 citations
- Boosting Few-Pixel Robustness Verification via Covering Verification DesignsYuval Shapira, Naor Wiesel, Shahar Shabelman, Dana Drachsler-CohenCAV 2024 · 2 citations
- Towards General Robustness Verification of MaxPool-Based Convolutional Neural Networks via Tightening Linear ApproximationYuan Xiao, Shiqing Ma, Juan Zhai, Chunrong Fang et al.CVPR 2024 · 1 citation
Builds on4
- Formal Security Analysis of Neural Networks using Symbolic IntervalsShiqi Wang, Kexin Pei, Justin Whitehouse, Junfeng Yang et al.USENIX Security 2018 · 523 citations
- Efficient Verification of ReLU-Based Neural Networks via Dependency AnalysisElena Botoeva, Panagiotis Kouvaros, Jan Kronqvist, Alessio Lomuscio et al.AAAI 2020 · 140 citations
- An Abstraction-Based Framework for Neural Network VerificationYizhak Yisrael Elboher, Justin Gottschlich, Guy KatzCAV 2020 · 97 citations
- Fastened CROWN: Tightened Neural Network Robustness CertificatesZhaoyang Lyu, Ching-Yun Ko, Zhifeng Kong, Ngai Wong et al.AAAI 2020 · 70 citations
Related papers
- Tightening Robustness Verification of MaxPool-based Neural Networks via Minimizing the Over-Approximation ZoneYuan Xiao, Yuchen Chen, Shiqing Ma, Chunrong Fang et al.CVPR 2025
- Second-Order Provable Defenses against Adversarial AttacksSahil Singla, Soheil FeiziICML 2020 · 64 citations
- Overcoming the Convex Barrier for Simplex InputsHarkirat Singh Behl, M. Pawan Kumar, Philip H. S. Torr, Krishnamurthy DvijothamNeurIPS 2021 · 7 citations
- Scalable Quantitative Verification For Deep Neural NetworksTeodora Baluta, Zheng Leong Chua, Kuldeep S. Meel, Prateek SaxenaICSE 2021 · 39 citations
- Boosting Verified Training for Robust Image Classifications via AbstractionZhaodi Zhang, Zhiyi Xue, Yang Chen, Si Liu et al.CVPR 2023
