- Rating
- 4
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper studies differentially private Principal Component Analysis, proposing a coherence-adaptive algorithm for estimating the top-k right singular subspace under row-level differential privacy. The authors extend previous results from the leading singular vector to the top-k subspace, using a preconditioned and clipped variant of block power iteration to reduce the noise required for privacy. The proposed algorithm provides improved utility for low-coherence inputs.
Critical strengths
The paper provides a clear and well-structured presentation of the problem and the relevant prior work, making it easy to understand the motivation and contributions. The proposed techniques are clearly explained and appear technically sound.
Critical weaknesses
I find the separate related work section somewhat redundant, as the introduction already provides a comprehensive overview of the relevant literature. I believe the paper would benefit more from using this space to provide a more detailed technical analysis or to discuss potential directions for future research.
Questions for authors
First of all, the footnotes at the bottom of page 2 are excessively long and somewhat disrupt the flow of the paper. I suggest shortening them or incorporating the relevant details into the main text or appendix to improve readability.
Additionally, from the comparison with prior work, it is not entirely clear in which way the proposed algorithm improves upon the rank-k guarantees of Dwork et al. (2014). Could the authors clarify what does small k \sigma_k^2 |U|_\infty^2 mean?
Author response
We thank the reviewer for their hard work and helpful suggestions.