2018/07/31 by Yu-Xiang Wang, Borja Balle, Wang, Yu-Xiang +3 · 21 citations
Computer Science · Decision Sciences · #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Privacy-Preserving Technologies in Data #Probability and Risk Models
paper · pdf · doi:10.48550/arxiv.1808.00087
openalex publication_date 2018/07/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the problem of subsampling in differential privacy (DP), a question\nthat is the centerpiece behind many successful differentially private machine\nlearning algorithms. Specifically, we provide a tight upper bound on the\nR 'enyi Differential Privacy (RDP) (Mironov, 2017) parameters for algorithms\nthat: (1) subsample the dataset, and then (2) applies a randomized mechanism M\nto the subsample, in terms of the RDP parameters of M and the subsampling\nprobability parameter. Our results generalize the moments accounting technique,\ndeveloped by Abadi et al. (2016) for the Gaussian mechanism, to any subsampled\nRDP mechanism.\n