Reliable Robustness Evaluation via Automatically Constructed Attack Ensembles
Not on the map. Why?
Abstract (arXiv)
Attack Ensemble (AE), which combines multiple attacks together, provides a reliable way to evaluate adversarial robustness. In practice, AEs are often constructed and tuned by human experts, which however tends to be sub-optimal and time-consuming. In this work, we present AutoAE, a conceptually simple approach for automatically constructing AEs. In brief, AutoAE repeatedly adds the attack and its iteration steps to the ensemble that maximizes ensemble improvement per additional iteration consumed. We show theoretically that AutoAE yields AEs provably within a constant factor of the optimal for a given defense. We then use AutoAE to construct two AEs for l∞ and l2 attacks, and apply them without any tuning or adaptation to 45 top adversarial defenses on the RobustBench leaderboard. In all except one cases we achieve equal or better (often the latter) robustness evaluation than existing AEs, and notably, in 29 cases we achieve better robustness evaluation than the best known one. Such performance of AutoAE shows itself as a reliable evaluation protocol for adversarial robustness, which further indicates the huge potential of automatic AE construction. Code is available at urlhttps://github.com/LeegerPENG/AutoAE.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 35 of its 48 references that are in the map. First posted on arXiv 23 Nov 2022.
Builds on
35 of 48 references.
References · 35
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,442
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
- 2019Square Attack: a query-efficient black-box adversarial attack via random searchcited by 682
- 2020RobustBench: a standardized adversarial robustness benchmarkcited by 659
- 2017Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methodscited by 542
- 2020Overfitting in adversarially robust deep learningcited by 504
- 2019Unlabeled Data Improves Adversarial Robustnesscited by 415
- 2019Minimally distorted Adversarial Examples with a Fast Adaptive Boundary Attackcited by 333
23 more
- 2018On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Modelscited by 322
- 2020Do Adversarially Robust ImageNet Models Transfer Better?cited by 315
- 2020Uncovering the Limits of Adversarial Training against Norm-Bounded Adversarial Examplescited by 275
- 2021Fixing Data Augmentation to Improve Adversarial Robustnesscited by 201
- 2020Bag of Tricks for Adversarial Trainingcited by 199
- 2020Geometry-aware Instance-reweighted Adversarial Trainingcited by 198
- 2018MMA Training: Direct Input Space Margin Maximization through Adversarial Trainingcited by 171
- 2019Are Labels Required for Improving Adversarial Robustness?cited by 162
- 2021Robust Learning Meets Generative Models: Can Proxy Distributions Improve Adversarial Robustness?cited by 113
- 2018Decoupling Direction and Norm for Efficient Gradient-Based L2 Adversarial Attacks and Defensescited by 109
- 2020Boosting Adversarial Training with Hypersphere Embeddingcited by 97
- 2019Defense Against Adversarial Attacks Using Feature Scattering-based Adversarial Trainingcited by 95
- 2020Learnable Boundary Guided Adversarial Trainingcited by 93
- 2020Adversarial Robustness on In- and Out-Distribution Improves Explainabilitycited by 73
- 2020Adversarial Machine Learning in Image Classification: A Survey Towards the Defender's Perspectivecited by 58
- 2018Provable Robustness of ReLU networks via Maximization of Linear Regionscited by 51
- 2019An Alternative Surrogate Loss for PGD-based Adversarial Testingcited by 45
- 2020Composite Adversarial Attackscited by 29
- 2021Efficient Combinatorial Optimization for Word-level Adversarial Textual Attackcited by 17
- 2017Maximizing Submodular or Monotone Approximately Submodular Functions by Multi-objective Evolutionary Algorithmscited by 15
- 2021Improving Neural Network Robustness via Persistency of Excitationcited by 14
- 2022Saliency Attack: Towards Imperceptible Black-box Adversarial Attackcited by 12
- 2018Automatic Construction of Parallel Portfolios via Explicit Instance Groupingcited by 11
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 1; 2026: 1.
6 papers.
- 2024Exploring the Adversarial Frontier: Quantifying Robustness via Adversarial Hypervolumecited by 3
- 2023Memory efficient location recommendation through proximity-aware representationcited by 0
- 2024Enhancing Output Diversity Improves Conjugate Gradient-based Adversarial Attackscited by 0
- 2024Computable Model-Independent Bounds for Adversarial Quantum Machine Learningcited by 0
- 2025Towards Provably Unlearnable Examples via Bayes Error Optimisationcited by 0
- 2026Adversarial Frontiers: Minimum-Norm Attack Ensembles for Robustness Evaluationcited by 0
- 2026Adversarial Frontiers: Minimum-Norm Attack Ensembles for Robustness Evaluation22 Jul 2026
- 2025Towards Provably Unlearnable Examples via Bayes Error Optimisation11 Nov 2025
- 2024Computable Model-Independent Bounds for Adversarial Quantum Machine Learning11 Nov 2024
- 2024Enhancing Output Diversity Improves Conjugate Gradient-based Adversarial Attacks7 Aug 2024
- 2024Exploring the Adversarial Frontier: Quantifying Robustness via Adversarial Hypervolume8 Mar 2024
- 2023Memory efficient location recommendation through proximity-aware representation10 Oct 2023