Automatic Perturbation Analysis for Scalable Certified Robustness and Beyond
Not on the map. Why?
Abstract (arXiv)
Linear relaxation based perturbation analysis (LiRPA) for neural networks, which computes provable linear bounds of output neurons given a certain amount of input perturbation, has become a core component in robustness verification and certified defense. The majority of LiRPA-based methods focus on simple feed-forward networks and need particular manual derivations and implementations when extended to other architectures. In this paper, we develop an automatic framework to enable perturbation analysis on any neural network structures, by generalizing existing LiRPA algorithms such as CROWN to operate on general computational graphs. The flexibility, differentiability and ease of use of our framework allow us to obtain state-of-the-art results on LiRPA based certified defense on fairly complicated networks like DenseNet, ResNeXt and Transformer that are not supported by prior works. Our framework also enables loss fusion, a technique that significantly reduces the computational complexity of LiRPA for certified defense. For the first time, we demonstrate LiRPA based certified defense on Tiny ImageNet and Downscaled ImageNet where previous approaches cannot scale to due to the relatively large number of classes. Our work also yields an open-source library for the community to apply LiRPA to areas beyond certified defense without much LiRPA expertise, e.g., we create a neural network with a probably flat optimization landscape by applying LiRPA to network parameters. Our opensource library is available at https://github.com/KaidiXu/auto_LiRPA.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 3; 2024: 1; 2025: 2; 2026: 1.
10 papers.
- 2021Robust Reinforcement Learning on State Observations with Learned Optimal Adversarycited by 133
- 2021CROP: Certifying Robust Policies for Reinforcement Learning through Functional Smoothingcited by 41
- 2022Holistic Adversarial Robustness of Deep Learning Modelscited by 11
- 2023Certifiably Robust Reinforcement Learning through Model-Based Abstract Interpretationcited by 2
- 2024Verification of Neural Network Control Systems in Continuous Timecited by 2
- 2025Exact Upper and Lower Bounds for the Output Distribution of Neural Networks with Random Inputscited by 2
- 2023Fooling the Textual Fooler via Randomizing Latent Representationscited by 1
- 2025A Scalable Approach to Probabilistic Neuro-Symbolic Robustness Verificationcited by 1
- 2023Adaptive Certified Training: Towards Better Accuracy-Robustness Tradeoffscited by 0
- 2026Shifting-based Optimizable Linear Relaxations for General Activation Functionscited by 0
- 2026Shifting-based Optimizable Linear Relaxations for General Activation Functions18 Jun 2026
- 2025Exact Upper and Lower Bounds for the Output Distribution of Neural Networks with Random Inputs17 Feb 2025
- 2025A Scalable Approach to Probabilistic Neuro-Symbolic Robustness Verification5 Feb 2025
- 2024Verification of Neural Network Control Systems in Continuous Time31 May 2024
- 2023Fooling the Textual Fooler via Randomizing Latent Representations2 Oct 2023
- 2023Adaptive Certified Training: Towards Better Accuracy-Robustness Tradeoffs24 Jul 2023
- 2023Certifiably Robust Reinforcement Learning through Model-Based Abstract Interpretation26 Jan 2023
- 2022Holistic Adversarial Robustness of Deep Learning Models15 Feb 2022
- 2021CROP: Certifying Robust Policies for Reinforcement Learning through Functional Smoothing17 Jun 2021
- 2021Robust Reinforcement Learning on State Observations with Learned Optimal Adversary21 Jan 2021