ABONN orders branch-and-bound sub-problems by a counterexample potentiality score and reports speedups of up to 15.2x on MNIST and 24.7x on CIFAR-10 over a naive branch-and-bound baseline.
Efficient neural network robustness certification with general activation functions,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification
ABONN orders branch-and-bound sub-problems by a counterexample potentiality score and reports speedups of up to 15.2x on MNIST and 24.7x on CIFAR-10 over a naive branch-and-bound baseline.