Semidefinite relaxation for deep ReLU verification suffers from 'interior-point vanishing' as depth increases, and removing layer-wise bound constraints mitigates it.
Efficient Verification of ReLU-Based Neural Networks via Dependency Analysis
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 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.