Research map / Learning theory and algorithms / Clustering
An Efficient Semismooth Newton based Algorithm for Convex Clustering
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 |
|---|---|---|---|
| Use SSNAL instead of AMA | Convex clustering model (2) · Two Half-Moon | computation time (seconds): 28.27 -> 0.51 | Helped |
| Use SSNAL instead of AMA | Convex clustering model (2) · Unbalanced Gaussian | computation time (seconds): 264.54 -> 1.15 | Helped |
| Use SSNAL instead of AMA | Convex clustering model (2) · MNIST | computation time (seconds): 79.48 -> 1.54 | Helped |
| Use SSNAL instead of AMA | Convex clustering model (2) · Fisher Iris | computation time (seconds): 0.58 -> 0.16 | Helped |
| Use SSNAL instead of AMA | Convex clustering model (2) · WINE | computation time (seconds): 2.62 -> 0.19 | Helped |
| Use SSNAL instead of AMA | Convex clustering model (2) · Yale Face B (10Train subset) | computation time (seconds): 211.36 -> 52.71 | Helped |
Closest papers by meaning
- Convex Clustering Redefined: Robust Learning with the Median of Means Estimator (AAAI 2026 · similarity 0.89)
- Clustering by Sum of Norms: Stochastic Incremental Algorithm, Convergence and Cluster Recovery (ICML 2017 · similarity 0.89)
- Scalable Second-order Riemannian Optimization for $K$-means Clustering (ICLR 2026 · similarity 0.88)
- Statistically Optimal $K$-means Clustering via Nonnegative Low-rank Semidefinite Programming (ICLR 2024 · similarity 0.87)
- Average Sensitivity of Hierarchical $k$-Median Clustering (ICML 2025 · similarity 0.86)
- Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems (ICLR 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.