Exact and Asymptotically Complete Robust Verifications of Neural Networks via Ising Solvers
A hybrid Benders solver with output-sensitive iteration bounds is developed, leveraging a Helly-based conflict compression theory to avoid generic exponential cut explosion and establishes an unconditionally polynomial Benders iteration complexity in network size.
Wen-Xin Li, Wen-Chao Liu, An-Zhe Jiang et al.
· 0 citations