Analyzing Inference Privacy Risks Through Gradients in Machine Learning
<|reference_start|>Analyzing Inference Privacy Risks Through Gradients in Machine Learning: In distributed learning settings, models are iteratively updated with shared gradients computed from potentially sensitive user data. While previous work has studied various privacy risks of sharing gradients, our paper aims to provide a systematic approach to analyze private information leakage from gradients. We present a unified game-based framework that encompasses a broad range of attacks including attribute, property, distributional, and user disclosures. We investigate how different uncertainties of the adversary affect their inferential power via extensive experiments on five datasets across various data modalities. Our results demonstrate the inefficacy of solely relying on data aggregation to achieve privacy against inference attacks in distributed learning. We further evaluate five types of defenses, namely, gradient pruning, signed gradient descent, adversarial perturbations, variational information bottleneck, and differential privacy, under both static and adaptive adversary settings. We provide an information-theoretic view for analyzing the effectiveness of these defenses against inference from gradients. Finally, we introduce a method for auditing attribute inference privacy, improving the empirical estimation of worst-case privacy through crafting adversarial canary records.<|reference_end|>
@article{li2024analyzing,
    title={Analyzing Inference Privacy Risks Through Gradients in Machine Learning},
    author={Zhuohang Li, Andrew Lowy, Jing Liu, Toshiaki Koike-Akino, Kieran
  Parsons, Bradley Malin, Ye Wang},
    journal={arXiv preprint arXiv:2408.16913},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.16913},
    primaryClass={cs.LG cs.AI cs.CR stat.ML}
}