mlsanityData to 14 Oct 2026

Uncovering the Limits of Proof Sharing for Neural Networks

arXiv 2608.19351 ↗First posted 19 Aug 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Robustness verification of neural networks is increasingly important, due to their use in many critical domains. In certain scenarios, proof sharing has been shown to accelerate incomplete verification techniques by reusing intermediate-layer abstract states, or templates, across queries. However, questions remain as to the robustness of template-based acceleration across varying network architectures, properties, datasets, and training methods. In this work, we perform a systematic study of the effectiveness of template-based acceleration and its limits. Our study shows that template subsumption rates can vary widely across scenarios. We present a novel metric of jointly stable neurons to explain this variation, showing that in some cases template-based techniques are very unlikely to provide any speedup. Then, we present FastCert, a novel technique for automatically distributing templates across neural network layers to increase performance impact, eschewing templates entirely if they are unlikely to produce a speedup. Across a large set of covering-design based L0-verification tasks, FastCert achieved an average speedup of 1.13x over an extant template-based reuse technique.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 48 references that are in the map. First posted on arXiv 19 Aug 2026.

Builds on

24 of 48 references.

References · 24

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  3. 2013Intriguing properties of neural networkscited by 5,155
  4. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
  5. 2017One pixel attack for fooling deep neural networkscited by 582
  6. 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 567
  7. 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 445
  8. 2019A Convex Relaxation Barrier to Tight Robustness Verification of Neural Networkscited by 125
  9. 2020SoK: Certified Robustness for Deep Neural Networkscited by 105
  10. 2020Certified Defenses for Adversarial Patchescited by 101
  11. 2018SparseFool: a few pixels make a big differencecited by 94
  12. 2024Marabou 2.0: A Versatile Formal Analyzer of Neural Networkscited by 81
12 more
  1. 2020Sparse-RS: a versatile framework for query-efficient sparse black-box adversarial attackscited by 65
  2. 2021Introduction to Neural Network Verificationcited by 63
  3. 2022Certified Training: Small Boxes are All You Needcited by 52
  4. 2021Scaling Up Exact Neural Network Compression by ReLU Stabilitycited by 19
  5. 2022Provable Defense Against Geometric Transformationscited by 14
  6. 2023Incremental Verification of Neural Networkscited by 14
  7. 2023Incremental Randomized Smoothing Certificationcited by 12
  8. 2021Shared Certificates for Neural Network Verificationcited by 10
  9. 2021Demanded Abstract Interpretation (Extended Version)cited by 4
  10. 2024Boosting Few-Pixel Robustness Verification via Covering Verification Designscited by 2
  11. 2024Towards Generalized Certified Robustness with Multi-Norm Trainingcited by 1
  12. 2025Tight Robustness Certification Through the Convex Hull of ℓ0 Attackscited by 1

Built on by

Not cited yet.