- Rating
- 1(−1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes PCOC. After operators submit and commit their operator-declaration pairs, public beacons are used to extract "audit probes." The method calculates the leave-one-out impact of removing an individual proposal on the soft-clustering output, along with an empirical Bernstein upper bound. A deterministic gate and a pre-declaration sequencer are then employed to select a new quorum, thereby incorporating decision-making impacts, into the admission audit process. Experimental results across five graph datasets, under both fixed and adaptive attack scenarios and with matched budgets, demonstrate a significant performance advantage.
Critical strengths
-
Following the commitment freeze, COC performs sampling to derive simultaneous upper bounds on the "leave-one-out" clustering impact of each proposal within the frozen audit pool. This approach captures the actual shifts in soft-clustering outputs that occur when a proposal is removed, addressing the limitations of methods like Krum or Trimmed Mean, which rely solely on parameter or update distances.
-
Deterministic gates and pre-declared sequencers render the new quorum selection process both verifiable and reproducible.
Critical weaknesses
Proposition 1 only guarantees coverage for the "leave-one-out" impact of individual proposals within the audited pool; it does not formally cover more general counterfactual scenarios, such as the simultaneous removal of multiple proposals or the substitution of stored entries, which would require separate definition.
Proposition 2 decomposes the probability of an assignment flip into a "probe probability near the decision boundary" plus an impact term. However, obtaining an actual numerical bound still requires estimating the boundary probability component. There remains a gap between the theoretical framework and its numerical application, a point that warrants further clarification from the authors.
Questions for authors
Please see the weaknesses.