Nearly Tight Black-Box Auditing of Differentially Private Machine Learning
<|reference_start|>Nearly Tight Black-Box Auditing of Differentially Private Machine Learning: This paper presents a nearly tight audit of the Differentially Private Stochastic Gradient Descent (DP-SGD) algorithm in the black-box model. Our auditing procedure empirically estimates the privacy leakage from DP-SGD using membership inference attacks; unlike prior work, the estimates are appreciably close to the theoretical DP bounds. The main intuition is to craft worst-case initial model parameters, as DP-SGD's privacy analysis is agnostic to the choice of the initial model parameters. For models trained with theoretical $\varepsilon=10.0$ on MNIST and CIFAR-10, our auditing procedure yields empirical estimates of $7.21$ and $6.95$, respectively, on 1,000-record samples and $6.48$ and $4.96$ on the full datasets. By contrast, previous work achieved tight audits only in stronger (i.e., less realistic) white-box models that allow the adversary to access the model's inner parameters and insert arbitrary gradients. Our auditing procedure can be used to detect bugs and DP violations more easily and offers valuable insight into how the privacy analysis of DP-SGD can be further improved.<|reference_end|>
@article{annamalai2024nearly,
    title={Nearly Tight Black-Box Auditing of Differentially Private Machine
  Learning},
    author={Meenatchi Sundaram Muthu Selva Annamalai and Emiliano De Cristofaro},
    journal={arXiv preprint arXiv:2405.14106},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.14106},
    primaryClass={cs.CR cs.LG}
}