Efficient node-private exact community recovery
Follow the latest progress by email.
For the balanced stochastic block model under the stated signal and community-growth assumptions, seek a polynomial-time pure node-private estimator matching the minimax exact-recovery risk with privacy parameter of order log n.
Why it matters and what counts as progress
Why it matters: It asks whether optimal private recovery is computationally feasible in a regime where the prior matching-risk method was exponential-time.
What counts as progress: A polynomial-time node-private estimator matching the minimax exact-recovery risk under the same block-model assumptions and privacy scale.
How the problem developed
- 2024 · Partial result [1]
Nguyen et al. Established exact community recovery under edge-level differential privacy; this does not protect each node’s full incident data.
- 10 Apr 2026 · Algorithm [2]
Klopp and Zadik Gave an exponential-time node-private exact-recovery algorithm for the stated stochastic block model and analyzed logarithmic privacy costs.
- 10 Jul 2026 · Algorithm [3]
Marchis, Klopp, Loh, and Zadik Reported a high-probability polynomial-time node-private algorithm nearly matching the exponential-time guarantee in the stated parameter regime.
AI contribution
Near-optimal node-private community estimation in polynomial-time
Under the stated balanced stochastic-block-model signal and community-growth assumptions, the authors give a high-probability polynomial-time pure node-private estimator attaining the prior exponential-time method’s minimax exact-recovery risk, with privacy parameter of order log n.
Sources
Website timeline
Publication dates and editorial changes.
ChatGPT-origin idea yields polynomial-time node-private community recovery