- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper studies the problem of differentially private weighted optimization. It incorporates the idea of differential clustering to handle zero or small weights. The authors present the theoretical privacy bound and the optimization error. They also provide numerical experiments to validate the effectiveness of the proposed methods.
Critical strengths
-
The author did provide the theoretical guarantee of privacy bound and the optimization error.
-
The author performed extensive empirical experiments to demonstrate the effectiveness of their methods.
Critical weaknesses
- The writing is very confusing and hard to follow:
- Most notations are used without introduced first; such as in line 24, in line 53, in line 27, in line 100, to name a few.
- The whole structure of this paper is messy. For example, the introduction should be structured like: problem formulation (may include some motivating examples)-> current related work weakness -> the main contributions of the work. The current introduction spends most paragraphs introducing abstract failures and potential fixes (lines 53 - 87). It is really hard to follow even though the core idea of using clustering is simple.
- The main text in section 4 and 5 are overloaded with symbols without proper notation section to summarize them.
- In line 11 - 15 of the abstract, the discussion of differentially private weight sampling is not the contribution of this paper. But the current framing is like this is from the author's contribution.
-
The core idea is a straightforward incorporation of differential clustering into the problem of differential weight clustering. It lacks insight of the problem.
-
In experiments, Table 8 and 12, the proposed method seems to incur a higher cost than baseline methods.
Questions for authors
See the weakness.
2 comments
Thanks for your reply! After reading the rebuttal, I still believe this paper cannot be accepted in its current state, so I will maintain my score.
Response to Reviewer e64X
We thank the reviewer for the careful reading and constructive feedback. Below, we address the three concerns.
Weakness 1. The writing is very confusing and hard to follow:
Response.
Thank you for pointing out these presentation issues. In the revised version, we have clarified our contributions in the Abstract and reorganized the Introduction to better explain the problem setting, motivation, and main contributions. We have also added a notation table in Section 3, a numerical example illustrating group totals in Section 4.1, and explicit definitions of the grouped objective and its optimum in Section 4.3.
Weakness 2. The core idea is a straightforward incorporation of differential clustering into the problem of differential weight clustering. It lacks insight into the problem.
Response.
Thank you for raising this concern. While grouping itself is a familiar technique, our contribution is to preserve small counts in private adaptive sampling. Positive sampling weights and single-coordinate stability provide pure DP guarantees (Theorem 4.3), while Theorem 4.4 bounds the approximation error under the original weights. Theorem 5.3 further provides an example where grouping small counts achieves substantially lower expected cost than using only threshold-selected weights.
Weakness 3. In experiments, Table 8 and 12, the proposed method seems to incur a higher cost than baseline methods.
Response.
Thank you for pointing this out. We acknowledge that GW has higher clustering costs in the cited comparisons. This is partly because GW incurs privacy costs for sampling and private swap decisions, while histogram methods perform optimization as post-processing. However, GW can achieve lower costs when small group weights are important for sampling. In a targeted low-count RSS experiment on USPS, GW achieved 2.99% lower cost than same-H HIST-GROUP (Appendix D.18.2).