GeoDA: a geometric framework for black-box adversarial attacks

Abstract

Adversarial examples are known as carefully perturbed images fooling image classifiers. We propose a geometric framework to generate adversarial examples in one of the most challenging black-box settings where the adversary can only generate a small number of queries, each of them returning the top-$1$ label of the classifier. Our framework is based on the observation that the decision boundary of deep networks usually has a small mean curvature in the vicinity of data samples. We propose an effective iterative algorithm to generate query-efficient black-box perturbations with small ${\ell }_p$ norms for $p\ge 1$, which is confirmed via experimental evaluations on state-of-the-art natural image classifiers. Moreover, for $p=2$, we theoretically show that our algorithm actually converges to the minimal ${\ell }_2$-perturbation when the curvature of the decision boundary is bounded. We also obtain the optimal distribution of the queries over the iterations of the algorithm. Finally, experimental results confirm that our principled black-box attack algorithm performs better than state-of-the-art algorithms as it generates smaller perturbations with a reduced number of queries.

arXiv commentIn Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2020

References in corpus (12)

• ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Models
• The Space of Transferable Adversarial Examples
• Black-box Adversarial Attacks with Limited Queries and Information
• Prior Convictions: Black-Box Adversarial Attacks with Bandits and Priors
• Improving Black-box Adversarial Attacks with a Transfer-based Prior
• Simple Black-Box Adversarial Perturbations for Deep Networks
• Robustness of classifiers: from adversarial to random noise
• Query-Efficient Hard-label Black-box Attack:An Optimization-based Approach
• AdaBatch: Adaptive Batch Sizes for Training Deep Neural Networks
• HopSkipJumpAttack: A Query-Efficient Decision-Based Attack
• On the Design of Black-box Adversarial Examples by Leveraging Gradient-free Optimization and Operator Splitting Method
• A geometry-inspired decision-based attack

Cited by in corpus (1)

• Transferable Sparse Adversarial Attack