A Spectral View of Adversarially Robust Features
Shivam Garg, Vatsal Sharan, Brian Hu Zhang, Gregory Valiant

TL;DR
This paper introduces a spectral method to identify adversarially robust features in datasets, providing both theoretical insights and empirical evidence that these features can improve model robustness and accuracy.
Contribution
The paper establishes a spectral connection to robust features and demonstrates how to extract them, offering a new approach to enhance adversarial robustness.
Findings
Spectral properties relate to robust features in datasets.
Robust features improve model robustness and accuracy.
The spectral approach provides a lower bound on robustness.
Abstract
Given the apparent difficulty of learning models that are robust to adversarial perturbations, we propose tackling the simpler problem of developing adversarially robust features. Specifically, given a dataset and metric of interest, the goal is to return a function (or multiple functions) that 1) is robust to adversarial perturbations, and 2) has significant variation across the datapoints. We establish strong connections between adversarially robust features and a natural spectral property of the geometry of the dataset and metric of interest. This connection can be leveraged to provide both robust features, and a lower bound on the robustness of any function that has significant variance across the dataset. Finally, we provide empirical evidence that the adversarially robust features given by this spectral approach can be fruitfully leveraged to learn a robust (and accurate) model.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Bacillus and Francisella bacterial research · Anomaly Detection Techniques and Applications
