Evading Adversarial Example Detection Defenses with Orthogonal Projected Gradient Descent
Oliver Bryniarski, Nabeel Hingun, Pedro Pachuca, Vincent Wang,, Nicholas Carlini

TL;DR
This paper introduces Orthogonal Projected Gradient Descent, a novel attack method that effectively evades multiple adversarial detection defenses by orthogonalizing gradients, significantly reducing detection accuracy to zero.
Contribution
The paper proposes a new gradient-based attack technique that improves evasion of detection defenses by orthogonalizing gradients during adversarial example generation.
Findings
Successfully evaded four state-of-the-art detection defenses.
Reduced detection accuracy to 0% while maintaining attack effectiveness.
Demonstrated the limitations of existing multi-constraint attack methods.
Abstract
Evading adversarial example detection defenses requires finding adversarial examples that must simultaneously (a) be misclassified by the model and (b) be detected as non-adversarial. We find that existing attacks that attempt to satisfy multiple simultaneous constraints often over-optimize against one constraint at the cost of satisfying another. We introduce Orthogonal Projected Gradient Descent, an improved attack technique to generate adversarial examples that avoids this problem by orthogonalizing the gradients when running standard gradient-based attacks. We use our technique to evade four state-of-the-art detection defenses, reducing their accuracy to 0% while maintaining a 0% detection rate.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Bacillus and Francisella bacterial research · Anomaly Detection Techniques and Applications
