- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper studies the problem of continual release of differentially private synthetic data in a longitudinal data collection. The authors introduce a new recursive mechanism that bakes the consistency insights of Bun et al.'s seminal work directly into its private count generation. By replacing the discrete gaussian mechanism with exponential mechanism, they avoid the need for padding, so the dataset size always stays the same. The theoretical privacy-accuracy tradeoff is worse than Bun et al. by a factor, but the empirical experiment demonstrates great utility, at the cost of longer run time.
Critical strengths
The mechanism proposed is intuitive and presented cleanly. It preserves the cardinality, gives the additional smaller length pattern benefits, and has a nice extension to categorical data case, at the cost of worse accuracy in worst case. I find it acceptable given the extra benefits mentioned above. Moreover, empirically, the proposed method outperforms bun et al. and the runtime overhead is completely reasonable.
Critical weaknesses
None.
Questions for authors
-
The reported experimental results suggest substantial improvements over Bun et al., but the metric does not seem to subtract the effect of the extra padding. I understand the motivation, but I wonder whether the proposed method still outperforms Bun et al. on length- patterns, when compared against their padding-debiased estimates. This would help me understand whether the benefit comes mostly from no-padding or from your exp. mech. count generation
-
Another question is about the recursive nature of the propose mechanism. I think the benefit of smaller length- patterns with is attractive, but the error cumulation seems unavoidable. Suppose we don't care about smaller length patterns, could we do noising, and then do a projection in a "feasible set", instead of padding + post-hoc correction as in Bun et al.? This would preserve the cardinality and i wonder if this can avoid the error accumulation.