Attacking Adversarial Defences by Smoothing the Loss Landscape
Panagiotis Eustratiadis, Henry Gouk, Da Li, Timothy Hospedales

TL;DR
This paper introduces a loss-smoothing technique using the Weierstrass transform to improve the reliability of gradient estimates and weaken obfuscation-based adversarial defenses in neural networks.
Contribution
It proposes a novel loss-smoothing method that enhances gradient-based and gradient-free attacks, countering defenses relying on rugged loss landscapes.
Findings
Effective against stochastic and non-stochastic defenses
Improves gradient estimate reliability
Weakens obfuscation-based robustness
Abstract
This paper investigates a family of methods for defending against adversarial attacks that owe part of their success to creating a noisy, discontinuous, or otherwise rugged loss landscape that adversaries find difficult to navigate. A common, but not universal, way to achieve this effect is via the use of stochastic neural networks. We show that this is a form of gradient obfuscation, and propose a general extension to gradient-based adversaries based on the Weierstrass transform, which smooths the surface of the loss function and provides more reliable gradient estimates. We further show that the same principle can strengthen gradient-free adversaries. We demonstrate the efficacy of our loss-smoothing method against both stochastic and non-stochastic adversarial defences that exhibit robustness due to this type of obfuscation. Furthermore, we provide analysis of how it interacts with…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Anomaly Detection Techniques and Applications · Forensic and Genetic Research
