Papers › Efficient Neural Network Robustness Certification with General Activation Functions
Efficient Neural Network Robustness Certification with General Activation Functions
Huan Zhang, Tsui-Wei Weng, Pin-Yu Chen, Cho-Jui Hsieh, Luca Daniel
Finding minimum distortion of adversarial examples and thus certifying robustness in neural network classifiers for given data points is known to be a challenging problem. Nevertheless, recently it has been shown to be possible to give a non-trivial certified lower bound of minimum adversarial distortion, and some recent progress has been made towards this direction by exploiting the piece-wise linear nature of ReLU activations. However, a generic robustness certification for general activation functions still remains largely unexplored. To address this issue, in this paper we introduce CROWN, a general framework to certify robustness of neural networks with general activation functions for given input data points. The novelty in our algorithm consists of bounding a given activation function with linear and quadratic functions, hence allowing it to tackle general activation functions including but not limited to four popular choices: ReLU, tanh, sigmoid and arctan. In addition, we facilitate the search for a tighter certified lower bound by adaptively selecting appropriate surrogates for each neuron activation. Experimental results show that CROWN on ReLU networks can notably improve the certified lower bounds compared to the current state-of-the-art algorithm Fast-Lin, while having comparable computational efficiency. Furthermore, CROWN also demonstrates its effectiveness and flexibility on networks with general activation functions, including tanh, sigmoid and arctan.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1811.00866")
Code
Syntology Ran 4 of 43 code samples harvested from 5 repositories linked to this paper; 39 have no recorded run. Of those that ran: 2 ran · honoured contract; 2 ran · our draft was wrong.
By repository: community (archive-listed): 43 samples from 5 repositories, 4 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
16 repositories listed; official and paper-mentioned ones first.
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.
Code Syntology ran Syntology
43 samples harvested; 4 ran; 2 honoured the contract we drafted; 39 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 3 of the 43 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 5 repositories linked to this paper, official or community; each sample names its own and says which. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.
961f8ae9024624c4 · report
86c9fa246614e9a9 · report
a0cf6bb81ff7819e · report
05f24c1d58d4690a · report
753617a588e4fc41 · report
67421da32aae154e · report
35286dc13357efe4 · report
9270bd3e922adfe2 · report
bbc8cb9f0698c825 · report
32794458cec639b5 · report
0e83f0ab852f5a0b · report
78bdba96d37bb59e · report
90f4d0f321d7321a · report
91b496effee73d52 · report
37fee45ec17c90a3 · report
9047985cc861bb05 · report
859c42b9a1c7fb44 · report
aff1aec26ddd75e4 · report
63f0738b7f84b19d · report
d338c893ca81dac0 · report
171e3d9dae850e45 · report
fcf70a46a28d44a2 · report
19a9b690599869b4 · report
98c1b7034a8af60a · report
1e47ec700db6f2be · report
754f9759bf35afba · report
c616cfbcc11326f3 · report
bcfb10a6fdde6ee1 · report
4fc767413887cc02 · report
ab7faf0047f2c872 · report
3b4fb87c66244ebf · report
2dfae576a64727fc · report
dd8e7c5361d6a51b · report
cba73c35959ddc1d · report
de5a9dcd60ab18e8 · report
fa98765e8a5ffef2 · report
52125b4504b9b441 · report
88ac5c47845ee90e · report
0b2c8166cb0eec6b · report
fd87678657cdbe5f · report
fe4cf0885a1400ce · report
82879d94252d9441 · report
22f9598f566ecc55 · report
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
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