Pith. sign in

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

arxiv 1809.03008 v3 pith:PU4RU4CN submitted 2018-09-09 cs.LG cs.CRcs.NEstat.ML

classification cs.LGcs.CRcs.NEstat.ML
keywords verificationrelustabilityadversarialimprovingnetworkneuralrobustness
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An analysis of optimization problems involving ReLU neural networks

    math.OC 2025-02 conditional novelty 6.0 of 10

    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.

Pith tools