Research map / Learning theory and algorithms / Sample complexity
Private estimation algorithms for stochastic block models and mixture models
Hongjie Chen, Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Jacob Imola, David Steurer, Stefan Tiegel
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the private exponential mechanism for recovery | SBM partial recovery · SBM partial recovery | privacy guarantee: ([?25l\epsilon, \delta[?25h)-DP -> \epsilon-DP | Improved |
| Privatize weak recovery and apply a boosting procedure | SBM exact recovery · SBM exact recovery | recovery | Improved |
| Replace the exact cluster-size constraint with an upper bound and minimize distance to the all-one matrix | Private GMM learner · Spherical Gaussian mixtures | privacy feasibility | Improved |
Closest papers by meaning
- Sample-Efficient Private Learning of Mixtures of Gaussians (NeurIPS 2024 · similarity 0.91)
- Public-data Assisted Private Stochastic Optimization: Power and Limitations (NeurIPS 2024 · similarity 0.87)
- An Iterative Algorithm for Differentially Private $k$-PCA with Adaptive Noise (NeurIPS 2025 · similarity 0.87)
- Differentially private exact recovery for stochastic block models (ICML 2024 · similarity 0.86)
- Locally Optimal Private Sampling: Beyond the Global Minimax (NeurIPS 2025 · similarity 0.86)
- A Differentially Private Clustering Algorithm for Well-Clustered Graphs (ICLR 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
