Research map / Learning theory and algorithms / Clustering
Optimal Sampling and Clustering in the Stochastic Block Model
Se-Young Yun, Alexandre Proutiere
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 adaptive sampling (ASP) instead of random sampling with the optimal clustering algorithm | SBM cluster recovery · Binary symmetric SBM, n=20000, p11=0.5, p12=0.1 | budget needed for exact recovery: exact recovery as soon as budget exceeds 450000 | Improved |
| adaptive sampling instead of non-adaptive sampling at budget T = n(n-1)/2 | binary symmetric SBM exact recovery condition · Exact recovery region in (a,b) | region of feasible exact recovery: sqrt(a)-sqrt(b) > sqrt(2) -> a log(a/b) + b - a > 1/2 | Improved |
Closest papers by meaning
- Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model (ICML 2025 · similarity 0.91)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.88)
- Query-Limited Community Recovery in Stochastic Block Models (NeurIPS 2026 · similarity 0.87)
- Network two-sample test for block models (NeurIPS 2025 · similarity 0.87)
- From Your Block to Our Block: How to Find Shared Structure Between Stochastic Block Models over Multiple Graphs (AAAI 2025 · similarity 0.87)
- Differentially private exact recovery for stochastic block models (ICML 2024 · similarity 0.87)
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.
