Research map / Learning theory and algorithms / Clustering
Communication-Optimal Distributed Clustering
Jiecao Chen, He Sun, David Woodruff, Qin Zhang
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 |
|---|---|---|---|
| sparsifier-based distributed spectral clustering (sites send local spectral sparsifiers) instead of sending all data | graph spectral clustering · Sculpture, Twomoons, Gauss | normalized cut: at most ~2% larger than centralized | No clear effect |
| blackboard recursive sampling instead of point-to-point sparsifier merging, as the number of sites grows | graph spectral clustering communication · Twomoons with 90 sites | edges communicated: MsgPassing communicates 9x edges of Blackboard | Improved |
| fewer blackboard iterations (chain length 5 instead of 18) (ablation) | blackboard sparsifier · graph clustering datasets | normalized cut: ncut values diverge | Hurt |
| sampling only 3n edges per site (c=3) with one site in message passing (ablation) | MsgPassing · graph clustering datasets | normalized cut: ncut diverges | Hurt |
| increasing sampled edges per site (c) or number of sites s in message passing (ablation) | MsgPassing · graph clustering datasets | normalized cut: slight decrease | Improved |
| more blackboard iterations and more sampled edges per iteration (ablation) | Blackboard · graph clustering datasets | normalized cut: reduces ncut | Improved |
Closest papers by meaning
- Distributed Algorithms for Euclidean Clustering (ICLR 2026 · similarity 0.91)
- Communication-Optimal Distributed Dynamic Graph Clustering (AAAI 2019 · similarity 0.90)
- Dynamic Correlation Clustering in Sublinear Update Time (ICML 2024 · similarity 0.85)
- A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering (ICML 2024 · similarity 0.85)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.85)
- Revisiting Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model (ICML 2025 · 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.
