Reordering branch-and-bound sub-problems by a counterexample-potentiality heuristic accelerates neural network verification, especially for falsified instances.
Branch and bound for piecewise linear neural network verification
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
-
Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees
Reordering branch-and-bound sub-problems by a counterexample-potentiality heuristic accelerates neural network verification, especially for falsified instances.