Boosting Few-Pixel Robustness Verification via Covering Verification Designs

Abstract

AbstractProving local robustness is crucial to increase the reliability of neural networks. While many verifiers prove robustness in $$L_\infty \ \epsilon $$ L ∞ ϵ -balls, very little work deals with robustness verification in $$L_0\ \epsilon $$ L 0 ϵ -balls, capturing robustness to few pixel attacks. This verification introduces a combinatorial challenge, because the space of pixels to perturb is discrete and of exponential size. A previous work relies on covering designs to identify sets for defining $$L_\infty $$ L ∞ neighborhoods, which if proven robust imply that the $$L_0\ \epsilon $$ L 0 ϵ -ball is robust. However, the number of neighborhoods to verify remains very high, leading to a high analysis time. We propose covering verification designs, a combinatorial design that tailors effective but analysis-incompatible coverings to $$L_0$$ L 0 robustness verification. The challenge is that computing a covering verification design introduces a high time and memory overhead, which is intensified in our setting, where multiple candidate coverings are required to identify how to reduce the overall analysis time. We introduce , an $$L_0$$ L 0 robustness verifier that selects between different candidate coverings without constructing them, but by predicting their block size distribution. This prediction relies on a theorem providing closed-form expressions for the mean and variance of this distribution. constructs the chosen covering verification design on-the-fly, while keeping the memory consumption minimal and enabling to parallelize the analysis. The experimental results show that reduces the verification time on average by up to 5.1x compared to prior work and that it scales to larger $$L_0\ \epsilon $$ L 0 ϵ -balls.