Linearity Grafting: Relaxed Neuron Pruning Helps Certifiable Robustness
Not on the map. Why?
Abstract (arXiv)
Certifiable robustness is a highly desirable property for adopting deep neural networks (DNNs) in safety-critical scenarios, but often demands tedious computations to establish. The main hurdle lies in the massive amount of non-linearity in large DNNs. To trade off the DNN expressiveness (which calls for more non-linearity) and robustness certification scalability (which prefers more linearity), we propose a novel solution to strategically manipulate neurons, by "grafting" appropriate levels of linearity. The core of our proposal is to first linearize insignificant ReLU neurons, to eliminate the non-linear components that are both redundant for DNN performance and harmful to its certification. We then optimize the associated slopes and intercepts of the replaced linear activations for restoring model performance while maintaining certifiability. Hence, typical neuron pruning could be viewed as a special case of grafting a linear function of the fixed zero slopes and intercept, that might overly restrict the network flexibility and sacrifice its performance. Extensive experiments on multiple datasets and network backbones show that our linearity grafting can (1) effectively tighten certified bounds; (2) achieve competitive certifiable robustness without certified robust training (i.e., over 30% improvements on CIFAR-10 models); and (3) scale up complete verification to large adversarially trained models with 17M parameters. Codes are available at https://github.com/VITA-Group/Linearity-Grafting.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 49 of its 73 references that are in the map. First posted on arXiv 15 Jun 2022.
Builds on
49 of 73 references.
References · 49
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 564
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
37 more
- 2017SkipNet: Learning Dynamic Routing in Convolutional Networkscited by 328
- 2018On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Modelscited by 322
- 2018Certified Defenses against Adversarial Examplescited by 305
- 2016Safety Verification of Deep Neural Networkscited by 262
- 2017Formal Verification of Piece-Wise Linear Feed-Forward Neural Networkscited by 241
- 2020Understanding and Improving Fast Adversarial Trainingcited by 213
- 2019Towards Stable and Efficient Training of Verifiably Robust Neural Networkscited by 204
- 2017BlockDrop: Dynamic Inference Paths in Residual Networkscited by 185
- 2018Formal Security Analysis of Neural Networks using Symbolic Intervalscited by 185
- 2020Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifierscited by 183
- 2018Semidefinite relaxations for certifying robustness to adversarial examplescited by 178
- 2018Stochastic Activation Pruning for Robust Adversarial Defensecited by 171
- 2018Efficient Formal Safety Analysis of Neural Networkscited by 165
- 2019What Do Compressed Deep Neural Networks Forget?cited by 164
- 2018Scaling provable adversarial defensescited by 141
- 2018A Dual Approach to Scalable Verification of Deep Networkscited by 125
- 2019A Convex Relaxation Barrier to Tight Robustness Verification of Neural Networkscited by 124
- 2019Adversarial Robustness vs Model Compression, or Both?cited by 98
- 2019Are All Layers Created Equal?cited by 94
- 2019Model Compression with Adversarial Robustness: A Unified Optimization Frameworkcited by 71
- 2021The Second International Verification of Neural Networks Competition (VNN-COMP 2021): Summary and Resultscited by 71
- 2018Training for Faster Adversarial Robustness Verification via Inducing ReLU Stabilitycited by 67
- 2020Enabling certification of verification-agnostic networks via memory-efficient semidefinite programmingcited by 65
- 2020The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verificationcited by 50
- 2019Neural Network Branching for Neural Network Verificationcited by 45
- 2021Fast Certified Robust Training with Short Warmupcited by 45
- 2021Improved Branch and Bound for Neural Network Verification via Lagrangian Decompositioncited by 44
- 2019Optimization and Abstraction: A Synergistic Approach for Analyzing Neural Network Robustnesscited by 40
- 2020Lagrangian Decomposition for Neural Network Verificationcited by 35
- 2017Output Range Analysis for Deep Neural Networkscited by 30
- 2021Drawing Robust Scratch Tickets: Subnetworks with Inborn Robustness Are Found within Randomly Initialized Networkscited by 29
- 2019Towards Compact and Robust Deep Neural Networkscited by 23
- 2021On the Effect of Pruning on Adversarial Robustnesscited by 23
- 2017DeepCloak: Masking Deep Neural Network Models for Robustness Against Adversarial Samplescited by 22
- 2019Fast Neural Network Verification via Shadow Pricescited by 17
- 2021ScaleCert: Scalable Certified Defense against Adversarial Patches with Sparse Superficial Layerscited by 15
- 2018MixTrain: Scalable Training of Verifiably Robust Neural Networkscited by 9
Built on by
Citing papers per year: 2023: 3; 2024: 2; 2025: 5.
10 papers.
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2023A DPLL(T) Framework for Verifying Deep Neural Networkscited by 23
- 2024Harnessing Neuron Stability to Improve DNN Verificationcited by 13
- 2025Dynamical Low-Rank Compression of Neural Networks with Robustness under Adversarial Attackscited by 5
- 2023Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retrainingcited by 4
- 2024Training Verification-Friendly Neural Networks via Neuron Behavior Consistencycited by 1
- 2025Lipschitz Constant Meets Condition Number: Learning Robust and Compact Deep Neural Networkscited by 1
- 2025Bridging Efficiency and Safety: Formal Verification of Neural Networks with Early Exitscited by 1
- 2025Enhancing Certifiable Semantic Robustness via Robust Pruning of Deep Neural Networkscited by 0
- 2025Lipschitz-aware Linearity Grafting for Certified Robustnesscited by 0
- 2025Bridging Efficiency and Safety: Formal Verification of Neural Networks with Early Exits23 Dec 2025
- 2025Lipschitz-aware Linearity Grafting for Certified Robustness29 Oct 2025
- 2025Enhancing Certifiable Semantic Robustness via Robust Pruning of Deep Neural Networks30 Sep 2025
- 2025Dynamical Low-Rank Compression of Neural Networks with Robustness under Adversarial Attacks12 May 2025
- 2025Lipschitz Constant Meets Condition Number: Learning Robust and Compact Deep Neural Networks26 Mar 2025
- 2024Training Verification-Friendly Neural Networks via Neuron Behavior Consistency17 Dec 2024
- 2024Harnessing Neuron Stability to Improve DNN Verification19 Jan 2024
- 2023Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retraining13 Aug 2023
- 2023A DPLL(T) Framework for Verifying Deep Neural Networks17 Jul 2023
- 2023Structured Pruning for Deep Convolutional Neural Networks: A survey1 Mar 2023