Papers › Scaling provable adversarial defenses

Scaling provable adversarial defenses

31 May 2018NeurIPS 2018 12arXiv:1805.12514archive 2025-07-28

Eric Wong, Frank R. Schmidt, Jan Hendrik Metzen, J. Zico Kolter

Recent work has developed methods for learning deep network classifiers that are provably robust to norm-bounded adversarial perturbation; however, these methods are currently only possible for relatively small feedforward networks. In this paper, in an effort to scale these approaches to substantially larger models, we extend previous work in three main directions. First, we present a technique for extending these training procedures to much more general networks, with skip connections (such as ResNets) and general nonlinearities; the approach is fully modular, and can be implemented automatically (analogous to automatic differentiation). Second, in the specific case of ℓ_∞ adversarial perturbations and networks with ReLU nonlinearities, we adopt a nonlinear random projection for training, which scales linearly in the number of hidden units (previous approaches scaled quadratically). Third, we show how to further improve robust error through cascade models. On both MNIST and CIFAR data sets, we train classifiers that improve substantially on the state of the art in provable robust adversarial error bounds: from 5.8% to 3.1% on MNIST (with ℓ_∞ perturbations of ϵ=0.1), and from 80% to 36.4% on CIFAR (with ℓ_∞ perturbations of ϵ=2/255). Code for all experiments in the paper is available at https://github.com/locuslab/convex_adversarial/.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

locuslab/convex_adversarial officialmentioned in papermentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Towards Deep Learning Models Resistant to Adversarial Attacks (arXiv:1706.06083; that paper's own run record: 9 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 8 unverified) and Provable defenses against adversarial examples via the convex outer adversarial polytope (arXiv:1711.00851; that paper's own run record: 21 ran (of which 15 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 1 violated, 17 with no contract checked; 2 where Syntology's instrument failed) · 23 unverified); nothing checks that they implement this paper's method. report
ColinQiyangLi/LConvNet mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Preventing Gradient Attenuation in Lipschitz Constrained Convolutional Networks (arXiv:1911.00937; that paper's own run record: 10 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 8 where Syntology's instrument failed) · 4 unverified); nothing checks that they implement this paper's method. report
KaidiXu/auto_LiRPA mentioned on GitHubpytorchNOASSERTIONSyntology: not harvested report
sungyoon-lee/bcp mentioned on GitHubpytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Models (arXiv:1810.12715; that paper's own run record: 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

ReLU

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections