REVIEW 1 cited by
Training for Faster Adversarial Robustness Verification via Inducing ReLU Stability
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We explore the concept of co-design in the context of neural network verification. Specifically, we aim to train deep neural networks that not only are robust to adversarial perturbations but also whose robustness can be verified more easily. To this end, we identify two properties of network models - weight sparsity and so-called ReLU stability - that turn out to significantly impact the complexity of the corresponding verification task. We demonstrate that improving weight sparsity alone already enables us to turn computationally intractable verification problems into tractable ones. Then, improving ReLU stability leads to an additional 4-13x speedup in verification times. An important feature of our methodology is its "universality," in the sense that it can be used with a broad range of training procedures and verification approaches.
Forward citations
Cited by 1 Pith paper
-
An analysis of optimization problems involving ReLU neural networks
L1 regularization of ReLU network weights is the most effective lever for speeding up mixed-integer optimization over the network, and there is a quantified trade-off between model redundancy and solver runtime.
Discussion (0). Continue with ORCID to comment.