Parameters or Privacy: A Provable Tradeoff Between Overparameterization and Membership Inference

Published in arXiv preprint arXiv:2202.01243, 2022

Recommended citation: Tan, J., Mason, B., Javadi, H., & Baraniuk, R. G. (2022). Parameters or Privacy: A Provable Tradeoff Between Overparameterization and Membership Inference. arXiv preprint arXiv:2202.01243. https://arxiv.org/pdf/2202.01243

A surprising phenomenon in modern machine learning is the ability of a highly overparameterized model to generalize well (small error on the test data) even when it is trained to memorize the training data (zero error on the training data). This has led to an arms race towards increasingly overparameterized models (c.f., deep learning). In this paper, we study an underexplored hidden cost of overparameterization: the fact that overparameterized models are more vulnerable to privacy attacks, in particular the membership inference attack that predicts the (potentially sensitive) examples used to train a model. We significantly extend the relatively few empirical results on this problem by theoretically proving for an overparameterized linear regression model with Gaussian data that the membership inference vulnerability increases with the number of parameters. Moreover, a range of empirical studies indicates that more complex, nonlinear models exhibit the same behavior. Finally, we study different methods for mitigating such attacks in the overparameterized regime, such as noise addition and regularization, and conclude that simply reducing the parameters of an overparameterized model is an effective strategy to protect it from membership inference without greatly decreasing its generalization error.

Download paper here

Recommended citation: Tan, J., Mason, B., Javadi, H., & Baraniuk, R. G. (2022). Parameters or Privacy: A Provable Tradeoff Between Overparameterization and Membership Inference. arXiv preprint arXiv:2202.01243.