Formulating Robustness Against Unforeseen Attacks
Sihui Dai, Saeed Mahloujifar, Prateek Mittal

TL;DR
This paper introduces a formal framework and a regularization method to improve the robustness of adversarial defenses against unforeseen attack models, enhancing generalization beyond known threat assumptions.
Contribution
It formally defines the problem of robustness against unforeseen adversaries, derives a generalization bound, and proposes variation regularization to improve test-time robustness.
Findings
Variation regularization improves robustness to unseen attacks.
Combining VR with perceptual adversarial training achieves state-of-the-art results.
Theoretical bounds relate feature extractor variation to adversarial risk.
Abstract
Existing defenses against adversarial examples such as adversarial training typically assume that the adversary will conform to a specific or known threat model, such as perturbations within a fixed budget. In this paper, we focus on the scenario where there is a mismatch in the threat model assumed by the defense during training, and the actual capabilities of the adversary at test time. We ask the question: if the learner trains against a specific "source" threat model, when can we expect robustness to generalize to a stronger unknown "target" threat model during test-time? Our key contribution is to formally define the problem of learning and generalization with an unforeseen adversary, which helps us reason about the increase in adversarial risk from the conventional perspective of a known adversary. Applying our framework, we derive a generalization bound which relates the…
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 · Anomaly Detection Techniques and Applications
