Membership Privacy Risks of Sharpness Aware Minimization
Young In Kim, Andrea Agiollo, Pratiksha Agrawal, Johannes O. Royset, Rajiv Khanna
TL;DR
This work challenges the intuition that flatter minima necessarily enhance membership privacy by showing that Sharpness-Aware Minimization (SAM) can increase membership inference risk even as it improves generalization. The authors combine empirical analyses of memorization and influence with a theoretical model of a mixture data distribution to explain why SAM's emphasis on atypical subclass patterns improves generalization but heightens privacy vulnerability. They introduce memorization and influence metrics, demonstrate that SAM memorizes more atypical sub-patterns and amplifies mid-to-high memorization samples, and provide a formal result showing higher minority-subclass alignment can yield both better generalization and higher MIA risk. The findings highlight a nuanced privacy-generalization trade-off in flat-minima optimization and motivate privacy-aware approaches for training robust models with constrained leakage.
Abstract
Optimization algorithms that seek flatter minima such as Sharpness-Aware Minimization (SAM) are widely credited with improved generalization. We ask whether such gains impact membership privacy. Surprisingly, we find that SAM is more prone to membership inference attacks than classical SGD across multiple datasets and attack methods, despite achieving lower test error. This is an intriguing phenomenon as conventional belief posits that higher membership privacy risk is associated with poor generalization. We conjecture that SAM is capable of memorizing atypical subpatterns more, leading to better generalization but higher privacy risk. We empirically validate our hypothesis by running extensive analysis on memorization and influence scores. Finally, we theoretically show how a model that captures minority subclass features more can effectively generalize better \emph{and} have higher membership privacy risk.
