Papers › On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Models

On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Models

30 Oct 2018arXiv:1810.12715archive 2025-07-28

Sven Gowal, Krishnamurthy Dvijotham, Robert Stanforth, Rudy Bunel, Chongli Qin, Jonathan Uesato, Relja Arandjelovic, Timothy Mann, Pushmeet Kohli

Recent work has shown that it is possible to train deep neural networks that are provably robust to norm-bounded adversarial perturbations. Most of these methods are based on minimizing an upper bound on the worst-case loss over all possible adversarial perturbations. While these techniques show promise, they often result in difficult optimization procedures that remain hard to scale to larger networks. Through a comprehensive analysis, we show how a simple bounding technique, interval bound propagation (IBP), can be exploited to train large provably robust neural networks that beat the state-of-the-art in verified accuracy. While the upper bound computed by IBP can be quite weak for general networks, we demonstrate that an appropriate loss and clever hyper-parameter schedule allow the network to adapt such that the IBP bound is tight. This results in a fast and stable learning algorithm that outperforms more sophisticated methods and achieves state-of-the-art results on MNIST, CIFAR-10 and SVHN. It also allows us to train the largest model to be verified beyond vacuous bounds on a downscaled version of ImageNet.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also 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

No sample from the archive's official repository (deepmind/interval-bound-propagation) is linked to this paper; the 6 samples below come from 2 community repositories. Syntology harvested code from deepmind/interval-bound-propagation for another paper.

deepmind/interval-bound-propagation: Syntology's graph links these samples to Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagation (arXiv:1909.01492; that paper's own run record: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method.

Syntology 6 code samples harvested from 2 repositories linked to this paper: 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. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: community (archive-listed): 6 samples from 2 repositories, 3 ran (2 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 3 of its repositories that Syntology harvested for other papers:

Levels written between 2026-09-22 and 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

deepmind/interval-bound-propagation officialmentioned in papermentioned on GitHubtfApache-2.0Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagation (arXiv:1909.01492; that paper's own run record: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
Ping-C/certifiedpatchdefense mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Certified Defenses for Adversarial Patches (arXiv:2003.06693; that paper's own run record: 3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified); nothing checks that they implement this paper's method. report
eth-sri/diffai mentioned on GitHubpytorchSyntology: 3 samples, 1 ran (1 instrument-failed) · 2 unverified report
huanzhang12/CROWN-IBP mentioned on GitHubpytorchBSD-2-ClauseSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Automatic Perturbation Analysis for Scalable Certified Robustness and Beyond (arXiv:2002.12920; that paper's own run record: 14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 3 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified); nothing checks that they implement this paper's method. report
j-cb/GOOD mentioned on GitHubpytorchSyntology: not harvested report
kyleliang919/Interval-bound-propagation-pytorch mentioned on GitHubpytorchSyntology: not harvested report
pawelmorawiecki/Interval_bound_propagation mentioned on GitHubpytorchSyntology: not harvested report
sungyoon-lee/bcp mentioned on GitHubpytorchMITSyntology: 3 samples, 2 ran (0 instrument-failed) · 1 unverified report
gitlab.com/Bitterwolf/GOOD mentioned on GitHubpytorchSyntology: not harvested 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

6 samples harvested: 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. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
2ran
3unverified

Licence: 3 of the 6 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. 3 samples whose link to this paper records no repository are listed under one of this paper's own repositories, because identical code was harvested from it for another paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

eth-sri/diffai community (archive-listed) 3 samples, 1 ran (1 instrument-failed) · 2 unverified
catNonNullErrors ai.py identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own ran · our draft was wrong licence of this copy not recorded · f8f37cd8a52870c1 · report fixture: signature op:callable/0/?, ref_errs:Tensor/1/float · returned function · level recorded 2026-09-22
creluBoxy ai.py identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own unverified licence of this copy not recorded · a49c0dd16152c346 · report
creluBoxySound ai.py identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own unverified licence of this copy not recorded · c42ef7b9012126aa · report
sungyoon-lee/bcp community (archive-listed) 3 samples, 2 ran (0 instrument-failed) · 1 unverified
argparser in 5 papers utils.py ran MIT (permissive) · 846b8ce1a0cef2b3 · report fixture: signature data:str/0/str, model:str/0/str, batch_size:int/0/int, epochs:int/0/int, warmup:int/0/int, rampup:int/0/int, augmentation:bool/0/bool, seed:int/0/int, verbose:int/0/int, epsilon:float/0/float, epsilon_infty:float/0/float, epsilon_train:float/0/float, epsilon_train_infty:float/0/float, starting_epsilon:float/0/float, opt:str/0/str, lr:float/0/float, momentum:float/0/float, weight_decay:float/0/float, step_size:int/0/int, gamma:float/0/float, lr_scheduler:str/0/str, wd_list:NoneType/0/?, starting_kappa:float/0/float, kappa:float/0/float, niter:int/0/int, opt_iter:int/0/int, sniter:int/0/int, test_opt_iter:int/0/int, test_sniter:int/0/int · returned Namespace · level recorded 2026-09-26
model_cnn_4layer utils.py ran MIT (permissive) · fb45ae0df896c8db · report fixture: signature in_ch:int/0/int, in_dim:int/0/int, width:int/0/int, linear_size:int/0/int · returned Sequential · level recorded 2026-09-26
select_model in 8 papers utils.py unverified MIT (permissive) · bb465636abefa4b4 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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