- Rating
- 4
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The private synthetic data generation algorithm, AIM, first applies exponential mechanisms and then applies DP-SGD (multiple Gaussian mechanisms). The standard privacy accounting applies composition theorem of these mechanisms under the same privacy notion. However, these mechanisms are best analyzed under different privacy notions, and converting between them using existing analysis can lead to a looser privacy accounting bound. Specifically, exponential mechanisms are best analyzed with bounded range (BR), while Gaussian mechanisms are better analyzed and composed with GDP or f-DP.
This paper provides a tighter privacy conversion from BR to GDP and f-DP than existing works, enabling a tighter composition of exponential mechanisms and DP-SGD, and hence a tighter privacy accounting for the AIM algorithm.
In addition, realistic data generation pipelines also include pre-processing steps, which consume part of the privacy budget. Hence, this work proposes MixCal to better calibrate the privacy budget assigned to each component in the pipeline, given that each component has an analytical privacy loss distribution (PLD).
Through experiments, they show that their proposed accounting reduces marginal errors in comparison with the original AIM algorithm.
Critical strengths
-
The paper provides a new, tighter privacy conversion analysis from bounded-range mechanisms to f-DP and GDP, which allows for a better composition analysis of exponential and Gaussian mechanisms. This is useful and can improve the privacy analysis of many such pipelines.
-
The paper is very well written. The background section is detailed and clear, and all results and their intuitions are very well explained.
Critical weaknesses
MixCal only calibrates the privacy budget assigned to each component, but its implications for the final utility of the pipeline are not clear. Multiple can satisfy the same final privacy guarantee, but MixCal doesn't seem to offer a way to select the best one. Additionally, the method appears to rely on all components having an analytical PLD, which may be difficult for some specific pre-processing algorithms.
Questions for authors
NA
2 comments
Thank you for the response. I agree that finding the optimal budget allocation is a reasonable future direction. Overall, I find the results of this paper interesting and significant, and therefore I'll maintain my positive score and recommend acceptance.
Response to Reviewer W2AN
Thank you for the review!
In our experiments, we found that the simple budget allocation rule based on standard zCDP analyses (see Appendix C.1) performs well and outperforms existing composition methods. Exploring the optimal allocation for generic pipelines requires a lot more investigation, including different application settings, as the question of choosing the "dummy" budget notion could be highly application-dependent through the specific choice of component mechanisms. As we mentioned in Section 6, we therefore designate such investigations to future work.
Indeed, and because our method shows improvements in utility and additional capabilities, we hope our findings motivate further work on deriving PLD-based analyses for more DP algorithms.