mlsanityData to 7 Oct 2026

On the Design of Black-box Adversarial Examples by Leveraging Gradient-free Optimization and Operator Splitting Method

arXiv 1907.11684 ↗First posted 26 Jul 2019cs.CV cs.CR cs.LGcited by 21

Not on the map. Why?

Abstract (arXiv)

Robust machine learning is currently one of the most prominent topics which could potentially help shaping a future of advanced AI platforms that not only perform well in average cases but also in worst cases or adverse situations. Despite the long-term vision, however, existing studies on black-box adversarial attacks are still restricted to very specific settings of threat models (e.g., single distortion metric and restrictive assumption on target model's feedback to queries) and/or suffer from prohibitively high query complexity. To push for further advances in this field, we introduce a general framework based on an operator splitting method, the alternating direction method of multipliers (ADMM) to devise efficient, robust black-box attacks that work with various distortion metrics and feedback settings without incurring high query complexity. Due to the black-box nature of the threat model, the proposed ADMM solution framework is integrated with zeroth-order (ZO) optimization and Bayesian optimization (BO), and thus is applicable to the gradient-free regime. This results in two new black-box adversarial attack generation methods, ZO-ADMM and BO-ADMM. Our empirical evaluations on image classification datasets show that our proposed approaches have much lower function query complexities compared to state-of-the-art attack methods, but achieve very competitive attack success rates.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Jul 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 2; 2023: 2; 2024: 6; 2025: 1; 2026: 3.

21 papers.

Sort:

By area:

  1. 2021Advances in adversarial attacks and defenses in computer vision: A surveycited by 127
  2. 2024Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmarkcited by 113
  3. 2023DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Trainingcited by 76
  4. 2021Mind the box: l1-APGD for sparse adversarial attacks on image classifierscited by 50
  5. 2024Enhancing Zeroth-order Fine-tuning for Language Models with Low-rank Structurescited by 48
  6. 2021Adversarial Robustness against Multiple and Single lp-Threat Models via Quick Fine-Tuning of Robust Classifierscited by 23
  7. 2021Back in Black: A Comparative Evaluation of Recent State-Of-The-Art Black-Box Attackscited by 16
  8. 2022Versatile Weight Attack via Flipping Limited Bitscited by 13
  9. 2022Holistic Adversarial Robustness of Deep Learning Modelscited by 11
  10. 2026Powering Up Zeroth-Order Training via Subspace Gradient Orthogonalizationcited by 11
  11. 2024Efficient Black-box Adversarial Attacks via Bayesian Optimization Guided by a Function Priorcited by 10
  12. 2024BruSLeAttack: A Query-Efficient Score-Based Black-Box Sparse Adversarial Attackcited by 7
9 more
  1. 2021Statistical Inference for Polyak-Ruppert Averaged Zeroth-order Stochastic Gradient Algorithmcited by 6
  2. 2023SoK: Pitfalls in Evaluating Black-Box Attackscited by 6
  3. 2021Adversarial Attacks on Graph Classification via Bayesian Optimisationcited by 5
  4. 2024Trust Regions for Explanations via Black-Box Probabilistic Certificationcited by 4
  5. 2025ZOQO: Zero-Order Quantized Optimizationcited by 4
  6. 2021LSDAT: Low-Rank and Sparse Decomposition for Decision-based Adversarial Attackcited by 1
  7. 2024SemiAdv: Query-Efficient Black-Box Adversarial Attack with Unlabeled Imagescited by 0
  8. 2026ZO-SAM: Zero-Order Sharpness-Aware Minimization for Efficient Sparse Trainingcited by 0
  9. 2026Curvature-Aware Zeroth-Order Optimization for Memory-Efficient Test-Time Adaptationcited by 0