mlsanityData to 7 Oct 2026

Zonotope Domains for Lagrangian Neural Network Verification

arXiv 2210.08069 ↗First posted 14 Oct 2022cs.LG stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

Neural network verification aims to provide provable bounds for the output of a neural network for a given input range. Notable prior works in this domain have either generated bounds using abstract domains, which preserve some dependency between intermediate neurons in the network; or framed verification as an optimization problem and solved a relaxation using Lagrangian methods. A key drawback of the latter technique is that each neuron is treated independently, thereby ignoring important neuron interactions. We provide an approach that merges these two threads and uses zonotopes within a Lagrangian decomposition. Crucially, we can decompose the problem of verifying a deep neural network into the verification of many 2-layer neural networks. While each of these problems is provably hard, we provide efficient relaxation methods that are amenable to efficient dual ascent procedures. Our technique yields bounds that improve upon both linear programming and Lagrangian-based verification techniques in both time and bound tightness.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 25 of its 47 references that are in the map. First posted on arXiv 14 Oct 2022.

Builds on

25 of 47 references.

References · 25

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  3. 2013Intriguing properties of neural networkscited by 5,114
  4. 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
  5. 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
  6. 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 564
  7. 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
  8. 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 413
  9. 2019Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networkscited by 290
  10. 2017Formal Verification of Piece-Wise Linear Feed-Forward Neural Networkscited by 241
  11. 2020Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifierscited by 183
  12. 2018Semidefinite relaxations for certifying robustness to adversarial examplescited by 178
13 more
  1. 2018Efficient Formal Safety Analysis of Neural Networkscited by 165
  2. 2018A Dual Approach to Scalable Verification of Deep Networkscited by 125
  3. 2019A Convex Relaxation Barrier to Tight Robustness Verification of Neural Networkscited by 124
  4. 2018Strong mixed-integer programming formulations for trained neural networkscited by 115
  5. 2020Exactly Computing the Local Lipschitz Constant of ReLU Networkscited by 102
  6. 2020Enabling certification of verification-agnostic networks via memory-efficient semidefinite programmingcited by 65
  7. 2019Neural Network Branching for Neural Network Verificationcited by 45
  8. 2021Improved Branch and Bound for Neural Network Verification via Lagrangian Decompositioncited by 44
  9. 2020Lagrangian Decomposition for Neural Network Verificationcited by 35
  10. 2019Provable Certificates for Adversarial Examples: Fitting a Ball in the Union of Polytopescited by 25
  11. 2020Certifying Incremental Quadratic Constraints for Neural Networks via Convex Optimizationcited by 17
  12. 2021DeepSplit: Scalable Verification of Deep Neural Networks via Operator Splittingcited by 8
  13. 2021Provable Lipschitz Certification for Generative Modelscited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 2.

5 papers.