Semidefinite relaxation for deep ReLU verification suffers from 'interior-point vanishing' as depth increases, and removing layer-wise bound constraints mitigates it.
Strong Mixed-Integer Programming Formulations for Trained Neural Networks.Mathematical Programming, 183(1):3–39, 2020
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
contradiction 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
contradiction 1polarities
refute 1representative citing papers
citing papers explorer
-
Interior-Point Vanishing Problem in Semidefinite Relaxations for Neural Network Verification
Semidefinite relaxation for deep ReLU verification suffers from 'interior-point vanishing' as depth increases, and removing layer-wise bound constraints mitigates it.