Trade-offs between membership privacy & adversarially robust learning
Jamie Hayes

TL;DR
This paper explores the complex relationship between adversarial robustness and privacy in machine learning, showing that the trade-off is not absolute and depends on data and model specifics, with empirical evidence from image datasets.
Contribution
It identifies conditions under which robust models may overfit less or more than standard models, challenging the notion of an unavoidable privacy-robustness trade-off.
Findings
Robust models can sometimes overfit less than standard models.
Training set size influences privacy risks in robust models.
Empirical results on CIFAR datasets support theoretical insights.
Abstract
Historically, machine learning methods have not been designed with security in mind. In turn, this has given rise to adversarial examples, carefully perturbed input samples aimed to mislead detection at test time, which have been applied to attack spam and malware classification, and more recently to attack image classification. Consequently, an abundance of research has been devoted to designing machine learning methods that are robust to adversarial examples. Unfortunately, there are desiderata besides robustness that a secure and safe machine learning model must satisfy, such as fairness and privacy. Recent work by Song et al. (2019) has shown, empirically, that there exists a trade-off between robust and private machine learning models. Models designed to be robust to adversarial examples often overfit on training data to a larger extent than standard (non-robust) models. If a…
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 · Privacy-Preserving Technologies in Data
