mlsanityData to 7 Oct 2026

Efficient Global Robustness Certification of Neural Networks via Interleaving Twin-Network Encoding

arXiv 2203.14141 ↗First posted 26 Mar 2022cs.LG cs.RO cs.SYcited by 15

Not on the map. Why?

Abstract (arXiv)

The robustness of deep neural networks has received significant interest recently, especially when being deployed in safety-critical systems, as it is important to analyze how sensitive the model output is under input perturbations. While most previous works focused on the local robustness property around an input sample, the studies of the global robustness property, which bounds the maximum output change under perturbations over the entire input space, are still lacking. In this work, we formulate the global robustness certification for neural networks with ReLU activation functions as a mixed-integer linear programming (MILP) problem, and present an efficient approach to address it. Our approach includes a novel interleaving twin-network encoding scheme, where two copies of the neural network are encoded side-by-side with extra interleaving dependencies added between them, and an over-approximation algorithm leveraging relaxation and refinement techniques to reduce complexity. Experiments demonstrate the timing efficiency of our work when compared with previous global robustness certification methods and the tightness of our over-approximation. A case study of closed-loop control safety verification is conducted, and demonstrates the importance and practicality of our approach for certifying the global robustness of neural networks in safety-critical systems.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 22 of its 53 references that are in the map. First posted on arXiv 26 Mar 2022.

Builds on

22 of 53 references.

References · 22

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  3. 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
  4. 2017Evasion Attacks against Machine Learning at Test Timecited by 686
  5. 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
  6. 2016Safety Verification of Deep Neural Networkscited by 262
  7. 2021Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verificationcited by 224
  8. 2017An approach to reachability analysis for feed-forward ReLU neural networkscited by 126
  9. 2017Maximum Resilience of Artificial Neural Networkscited by 97
  10. 2016Measuring Neural Net Robustness with Constraintscited by 90
  11. 2019Robustness of Neural Networks: A Probabilistic and Practical Approachcited by 38
  12. 2021POLAR: A Polynomial Arithmetic Framework for Verifying Neural-Network Controlled Systemscited by 38
10 more
  1. 2021Learning Security Classifiers with Verified Global Robustness Propertiescited by 14
  2. 2022Joint Differentiable Optimization and Verification for Certified Reinforcement Learningcited by 11
  3. 2022Physics-Aware Safety-Assured Design of Hierarchical Neural Network based Plannercited by 9
  4. 2020Energy-Efficient Control Adaptation with Safety Guarantees for Learning-Enabled Cyber-Physical Systemscited by 7
  5. 2013The Unary Fragments of Metric Interval Temporal Logic: Bounded versus Lower bound Constraints (Full Version)cited by 6
  6. 2020Opportunistic Intermittent Control with Safety Guarantees for Autonomous Systemscited by 5
  7. 2021End-to-end Uncertainty-based Mitigation of Adversarial Attacks to Automated Lane Centeringcited by 5
  8. 2021Learning-based Framework for Sensor Fault-Tolerant Building HVAC Control with Model-assisted Learningcited by 4
  9. 2021Cocktail: Learn a Better Neural Network Controller from Multiple Experts via Adaptive Mixing and Robust Distillationcited by 3
  10. 2020Cross-Layer Design of Automotive Systemscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 5; 2024: 1; 2025: 3; 2026: 3.

15 papers.

Sort: