- Rating
- 2
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Pollen studies privacy leakage from the structure of sparse federated updates: even when update values are protected, per-client active-index sets can enable cross-round re-identification. This paper argues that revealing only the union of active indices and their summed updates is sufficient for sparse aggregation, then implements this output through a single-server, IBLT-based labeled private set union built on secure aggregation. Experiments test the linkage attack, communication and runtime, and learning loss on selected tasks.
Critical strengths
- The connection between a concrete index-based attack and a protocol designed to remove that attack surface, and the practical benefit of supporting sparse aggregation with one server and no large offline phase.
- It avoids the large offline communication required by the compared single-server sparse aggregation schemes.
- It identifies and measures a privacy risk that remains when gradient values are hidden but individual index sets are visible. Its randomized IBLT construction combines duplicate indices and their labels while concealing how many clients contributed each index.
Critical weaknesses
- A dense aggregate reveals the union only if active updates do not cancel to zero. The privacy comparison depends on this condition. The cancellation analysis assumes a distribution that is not established for the actual sum of clients’ quantized updates, and the 45 union-recovery trials provide limited evidence for rare failures at scale. This matters because union disclosure could otherwise reveal information unavailable from ideal dense aggregation.
- The paper does not clearly identify which sparsification setting produced Figure 4’s loss curves. Thus, the strongest saving is not yet paired with evidence of its learning-quality cost.
Questions for authors
- For the actual quantized client updates, how often does an active index cancel to zero in the aggregate, and what additional information does Pollen reveal if that happens?
- Which setting produced Figure 4? Are learning-quality results available for the and settings responsible for Table 5’s largest savings?
- What concrete multi-round decoding-failure bound is supported by the chosen IBLT parameters, given the confidence bound on the zero-failure trials?
- Do the communication totals include secure-aggregation setup traffic and the model broadcast to clients, or do the reported savings concern client upload only?
Rebuttal for Reviewer 83dZ
Cancellation measurements:
The 45 union-recovery trials establish recovery in the tested executions, rather than a negligible cancellation bound. Appendix F.1’s Gaussian assumptions and quantization order have not been established for the actual sum of quantized client updates. We present that calculation as conditional and retain an explicit honest-residual cancellation term in the end-to-end comparison. Measurements of total-aggregate recovery alone do not validate the condition under collusion.
Utility and communication scope:
In the updated version (Figure 4, p. 9; Section 5, p. 10; Appendix D.3, pp. 19–21, including Figure S1 on p. 21), we are identifying Figure 4’s exact sparsification configuration and restrict its utility conclusion to that setting. Figure 4 concerns only LMPSU applied on the embedding level without gradient sparsification effect, so K/L for the experiment stays at 1. We explicitly mention this in the updated manuscript. To evaluate the utility implications of additional sparsification, we add loss comparisons at (K/L=0.01) and (0.001) between Pollen and plaintext aggregation using identical sparsification and training settings. We also include the plaintext (K/L=1) reference. Comparing Pollen with plaintext under the same sparsification isolates any additional loss introduced by the aggregation protocol, while comparison with the (K/L=1) reference shows the effect of sparsification itself.
We agree that the largest communication savings should be interpreted alongside their learning-quality cost. We therefore distinguish communication-only benchmarks from configurations with measured utility results and restrict our utility claims accordingly. The reported per-client cost estimates exclude model broadcast and server downloads, while setup and recovery traffic are not fully counted by the fixed amortized control term. Table 5’s caption (p. 9) and Appendix D.4 (pp. 21–23) now state these accounting boundaries explicitly. The Pollen/Flamingo ratios compare payload-plus-control estimates; they are not measurements of end-to-end communication savings under a common SA backend.
Concrete decoding-failure bound:
The 45 union-recovery trials are separate from Table 6’s peeling experiments, which report 1,048,576 trials and zero observed peeling failures for each selected configuration.
For a configuration fixed before independent validation, this outcome would yield a one-sided 95% upper confidence bound of approximately 2.857 × 10⁻⁶ on the peeling-failure probability. Over 100 rounds, the union-bound contribution would be approximately 2.857 × 10⁻⁴, with Theorem 6’s algebraic failure terms added for each round.
The available records do not establish independent post-selection validation, so this calculation does not certify 95% coverage for the selected configurations. We now explicitly distinguish Table 6’s empirical point estimates from confidence upper bounds in Appendix C.1 (“Interpreting zero failures,” p. 17).