A Semidefinite Relaxation Based Branch-and-Bound Method for Tight Neural Network Verification
Jianglin Lan, Benedikt Brückner, Alessio R. Lomuscio · Proceedings of the AAAI Conference on Artificial Intelligence · 2023
We introduce a novel method based on semidefinite program (SDP) for the tight and efficient verification of neural networks. The proposed SDP relaxation advances the present state of the art in SDP-based neural network verification by adding a set of linear constraints based on eigenvectors. We extend this novel SDP relaxation by combining it with a branch-and-bound method that can provably close the relaxation gap up to zero. We show formally that the proposed approach leads to a provably tighter solution than the present state of the art. We report experimental results showing that the proposed method outperforms baselines in terms of verified accuracy while retaining an acceptable computational overhead.