Can we infer the presence of Differential Privacy in Deep Learning models' weights? Towards more secure Deep Learning
Not on the map. Why?
Abstract (arXiv)
Differential Privacy (DP) is a key property to protect data and models from integrity attacks. In the Deep Learning (DL) field, it is commonly implemented through the Differentially Private Stochastic Gradient Descent (DP-SGD). However, when a model is shared or released, there is no way to check whether it is differentially private, that is, it required to trust the model provider. This situation poses a problem when data privacy is mandatory, specially with current data regulations, as the presence of DP can not be certificated consistently by any third party. Thus, we face the challenge of determining whether a DL model has been trained with DP, according to the title question: Can we infer the presence of Differential Privacy in Deep Learning models' weights? Since the DP-SGD significantly changes the training process of a DL model, we hypothesize that DP leaves an imprint in the weights of a DL model, which can be used to predict whether a model has been trained with DP regardless of its architecture and the training dataset. In this paper, we propose to employ the imprint in model weights of using DP to infer the presence of DP training in a DL model. To substantiate our hypothesis, we developed an experimental methodology based on two datasets of weights of DL models, each with models with and without DP training and a meta-classifier to infer whether DP was used in the training process of a DL model, by accessing its weights. We accomplish both, the removal of the requirement of a trusted model provider and a strong foundation for this interesting line of research. Thus, our contribution is an additional layer of security on top of the strict private requirements of DP training in DL models, towards to DL models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 39 references that are in the map. First posted on arXiv 20 Nov 2023.
Builds on
23 of 39 references.
References · 23
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2016Deep Learning with Differential Privacycited by 2,728
- 2019Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AIcited by 1,552
- 2014Striving for Simplicity: The All Convolutional Netcited by 990
- 2021Membership Inference Attacks From First Principlescited by 878
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
- 2017Renyi Differential Privacycited by 650
- 2019Differential Privacy Has Disparate Impact on Model Accuracycited by 316
- 2020Auditing Differentially Private Machine Learning: How Private is Private SGD?cited by 218
- 2021Adversary Instantiation: Lower Bounds for Differentially Private Machine Learningcited by 199
- 2023How to DP-fy ML: A Practical Guide to Machine Learning with Differential Privacycited by 153
11 more
- 2020Predicting trends in the quality of state-of-the-art neural networks without access to training or testing datacited by 115
- 2018Predicting the Generalization Gap in Deep Networks with Margin Distributionscited by 113
- 2020Predicting Neural Network Accuracy from Weightscited by 110
- 2014Freeze-Thaw Bayesian Optimizationcited by 90
- 2020Classifying the classifier: dissecting the weight space of neural networkscited by 65
- 2019Heavy-Tailed Universality Predicts Trends in Test Accuracies for Very Large Pre-Trained Deep Neural Networkscited by 44
- 2019Towards Task and Architecture-Independent Generalization Gap Predictorscited by 18
- 2018TAPAS: Train-less Accuracy Predictor for Architecture Searchcited by 11
- 2021Hyper-Representations: Self-Supervised Representation Learning on Neural Network Weights for Model Characteristic Predictioncited by 9
- 2019Learning Effective Loss Functions Efficientlycited by 2
- 2019Learning Optimal Linear Regularizerscited by 1
Built on by
Not cited yet.