Generalized Likelihood Ratio Test for Adversarially Robust Hypothesis Testing
Not on the map. Why?
Abstract (arXiv)
Machine learning models are known to be susceptible to adversarial attacks which can cause misclassification by introducing small but well designed perturbations. In this paper, we consider a classical hypothesis testing problem in order to develop fundamental insight into defending against such adversarial perturbations. We interpret an adversarial perturbation as a nuisance parameter, and propose a defense based on applying the generalized likelihood ratio test (GLRT) to the resulting composite hypothesis testing problem, jointly estimating the class of interest and the adversarial perturbation. While the GLRT approach is applicable to general multi-class hypothesis testing, we first evaluate it for binary hypothesis testing in white Gaussian noise under ℓ∞ norm-bounded adversarial perturbations, for which a known minimax defense optimizing for the worst-case attack provides a benchmark. We derive the worst-case attack for the GLRT defense, and show that its asymptotic performance (as the dimension of the data increases) approaches that of the minimax defense. For non-asymptotic regimes, we show via simulations that the GLRT defense is competitive with the minimax approach under the worst-case attack, while yielding a better robustness-accuracy tradeoff under weaker attacks. We also illustrate the GLRT approach for a multi-class hypothesis testing problem, for which a minimax strategy is not known, evaluating its performance under both noise-agnostic and noise-aware adversarial settings, by providing a method to find optimal noise-aware attacks, and heuristics to find noise-agnostic attacks that are close to optimal in the high SNR regime.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 35 references that are in the map. First posted on arXiv 4 Dec 2021.
Builds on
25 of 35 references.
References · 25
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2016Adversarial examples in the physical worldcited by 1,762
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
- 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 564
- 2020On Adaptive Attacks to Adversarial Example Defensescited by 547
- 2019Unlabeled Data Improves Adversarial Robustnesscited by 415
- 2017Wild Patterns: Ten Years After the Rise of Adversarial Machine Learningcited by 411
- 2018Certified Defenses against Adversarial Examplescited by 305
13 more
- 2017Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulationcited by 182
- 2018Semidefinite relaxations for certifying robustness to adversarial examplescited by 178
- 2018Scaling provable adversarial defensescited by 141
- 2020Multi-task self-supervised learning for Robust Speech Recognitioncited by 127
- 2018Adversarial examples from computational constraintscited by 79
- 2019Lower Bounds on Adversarial Robustness from Optimal Transportcited by 52
- 2020Provable tradeoffs in adversarially robust classificationcited by 39
- 2019Adversarial Risk via Optimal Transport and Optimal Couplingscited by 36
- 2018Sparsity-based Defense against Adversarial Attacks on Linear Classifierscited by 8
- 2020Action-Manipulation Attacks Against Stochastic Bandits: Attacks and Defensecited by 8
- 2021Robust Classification Under ℓ0 Attack for the Gaussian Mixture Modelcited by 5
- 2020Adversarially Robust Classification based on GLRTcited by 2
- 2020Polarizing Front Ends for Robust CNNscited by 1
Built on by
Not cited yet.