Implications of Solution Patterns on Adversarial Robustness


Empirical robustness evaluation (RE) of deep learning models against adversarial perturbations involves solving non-trivial constrained optimization problems. Recent works have shown that these RE problems can be reliably solved by a general-purpose constrained-optimization solver, PyGRANSO with Constraint-Folding (PWCF). In this paper, we take advantage of PWCF and other existing numerical RE algorithms to explore the distinct solution patterns in solving the RE problems with various combinations of losses, perturbation models, and optimization algorithms. We then provide extensive discussions on the implications of these patterns on current robustness evaluation and adversarial training

In Computer Vision and Pattern Recognition (CVPR) Workshop of Adversarial Machine Learning on Computer Vision (Art of Robustness)
Buyun Liang
Buyun Liang
Computer and Information Science Ph.D. Student