← Search

Jianglin Lan

5 accepted papers

2023

A Semidefinite Relaxation Based Branch-and-Bound Method for Tight Neural Network Verification

AAAI 2023technical

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 exte…

Cited by 5SourcePDFScholar
2023

Iteratively Enhanced Semidefinite Relaxations for Efficient Neural Network Verification

AAAI 2023technical

We propose an enhanced semidefinite program (SDP) relaxation to enable the tight and efficient verification of neural networks (NNs). The tightness improvement is achieved by introducing a nonlinear constraint to existing SDP relaxations previously proposed for NN verification. The efficiency of the…

Cited by 3SourcePDFScholar
2022

Tight Neural Network Verification via Semidefinite Relaxations and Linear Reformulations

AAAI 2022technical

We present a novel semidefinite programming (SDP) relaxation that enables tight and efficient verification of neural networks. The tightness is achieved by combining SDP relaxations with valid linear cuts, constructed by using the reformulation-linearisation technique (RLT). The computational effici…

Cited by 24SourcePDFScholar