CorrAttack: Black-box Adversarial Attack with Structured Search
Not on the map. Why?
Abstract (arXiv)
We present a new method for score-based adversarial attack, where the attacker queries the loss-oracle of the target model. Our method employs a parameterized search space with a structure that captures the relationship of the gradient of the loss function. We show that searching over the structured space can be approximated by a time-varying contextual bandits problem, where the attacker takes feature of the associated arm to make modifications of the input, and receives an immediate reward as the reduction of the loss function. The time-varying contextual bandits problem can then be solved by a Bayesian optimization procedure, which can take advantage of the features of the structured action space. The experiments on ImageNet and the Google Cloud Vision API demonstrate that the proposed method achieves the state of the art success rates and query efficiencies for both undefended and defended models.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 1.
4 papers.
- 2022Fast Adversarial Training with Adaptive Step Sizecited by 24
- 2024Efficient Black-box Adversarial Attacks via Bayesian Optimization Guided by a Function Priorcited by 10
- 2021Meta-Learning the Search Distribution of Black-Box Random Search Based Adversarial Attackscited by 7
- 2021Adversarial Attacks on Graph Classification via Bayesian Optimisationcited by 5
- 2024Efficient Black-box Adversarial Attacks via Bayesian Optimization Guided by a Function Prior29 May 2024
- 2022Fast Adversarial Training with Adaptive Step Size6 Jun 2022
- 2021Adversarial Attacks on Graph Classification via Bayesian Optimisation4 Nov 2021
- 2021Meta-Learning the Search Distribution of Black-Box Random Search Based Adversarial Attacks2 Nov 2021