Robustness of Sketched Linear Classifiers to Adversarial Attacks
Lists
Only you see this
Abstract
Linear classifiers are well-known to be vulnerable to adversarial attacks: they may predict incorrect labels for input data that are adversarially modified with small perturbations. However, this phenomenon has not been properly understood in the context of sketch-based linear classifiers, typically used in memory-constrained paradigms, which rely on random projections of the features for model compression. In this paper, we propose novel Fast-Gradient-Sign Method (FGSM) attacks for sketched classifiers in full, partial, and black-box information settings with regards to their internal parameters. We perform extensive experiments on the MNIST dataset to characterize their robustness as a function of perturbation budget. Our results suggest that, in the full-information setting, these classifiers are less accurate on unaltered input than their uncompressed counterparts but just as susceptible to adversarial attacks. But in more realistic partial and black-box information settings, sketching improves robustness while having lower memory footprint.
BibTeX
@inproceedings{mahadevan2022robustness,
author = {Ananth Mahadevan and Arpit Merchant and Yanhao Wang and Michael Mathioudakis},
title = {{Robustness of Sketched Linear Classifiers to Adversarial Attacks}},
booktitle = {ACM International Conference on Information and Knowledge Management},
year = {2022},
doi = {10.1145/3511808.3557687},
}Loading related content...