Papers › Provable robustness against all adversarial lₚ-perturbations for p≥1

Provable robustness against all adversarial lₚ-perturbations for p≥1

27 May 2019ICLR 2020 1arXiv:1905.11213archive 2025-07-28

Francesco Croce, Matthias Hein

In recent years several adversarial attacks and defenses have been proposed. Often seemingly robust models turn out to be non-robust when more sophisticated attacks are used. One way out of this dilemma are provable robustness guarantees. While provably robust models for specific lₚ-perturbation models have been developed, we show that they do not come with any guarantee against other l_q-perturbations. We propose a new regularization scheme, MMR-Universal, for ReLU networks which enforces robustness wrt l₁- and l_∞-perturbations and show how that leads to the first provably robust models wrt any lₚ-norm for p≥1.

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

fra31/mmr-universal officialmentioned in papermentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to 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

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.

Tasks

All

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