Research map / Learning theory and algorithms / Clustering
Clustering by Sum of Norms: Stochastic Incremental Algorithm, Convergence and Cluster Recovery
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 |
|---|---|---|---|
| stochastic incremental proximal splitting instead of exact CVX solver for SON | SON clustering · Gaussian mixtures, 200 samples in R2 | Adjusted Rand index | No clear effect |
| stochastic splitting instead of exact solver | SON clustering · Mixture of two Gaussians, increasing sample size | running time | Helped |
| stochastic splitting has narrower range of good lambda values than exact | SON clustering · Gaussian mixtures, varying sigma^2 | Adjusted Rand index over lambda | Hurt |
Closest papers by meaning
- An Efficient Semismooth Newton based Algorithm for Convex Clustering (ICML 2018 · similarity 0.89)
- Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search (NeurIPS 2017 · similarity 0.89)
- Ultrametric Cluster Hierarchies: I Want ‘em All! (NeurIPS 2025 · similarity 0.87)
- Average Sensitivity of Hierarchical $k$-Median Clustering (ICML 2025 · similarity 0.87)
- Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants (AAAI 2024 · similarity 0.87)
- Hierarchical Overlapping Clustering on Graphs: Cost Function, Algorithm and Scalability (ICML 2025 · similarity 0.86)
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.