Interior-Point Vanishing Problem in Semidefinite Relaxations for Neural Network Verification

Ryota Ueda, Takami Sato, Ken Kobayashi +1

Semidefinite programming (SDP) relaxation has emerged as a promising approach for neural network verification, offering tighter bounds than other convex relaxation methods for deep…