Research map / Learning theory and algorithms / Clustering
Label consistency in overfitted generalized $k$-means
Linfan Zhang, Arash A Amini
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 |
|---|---|---|---|
| increase number of fitted clusters L from 2 to 4 or 10 (overfitting) | k-means · line-circle model (simulated) | misclassification rate | Improved |
| increase separation delta between clusters | k-means with L>2 · line-Gaussian mixture (simulated) | misclassification rate | Improved |
| increase number of fitted clusters L from 2 to 4 or 10 | k-means · circle-torus model (simulated) | misclassification rate | Improved |
Closest papers by meaning
- Online Clustering with Nearly Optimal Consistency (ICLR 2025 · similarity 0.87)
- The Complexity of k-Means Clustering when Little is Known (ICML 2022 · similarity 0.86)
- Clustering Stable Instances of Euclidean k-means. (NeurIPS 2017 · similarity 0.86)
- Improved Learning-augmented Algorithms for k-means and k-medians Clustering (ICLR 2023 · similarity 0.86)
- Unified K-Means Clustering with Label-Guided Manifold Learning (ICML 2025 · similarity 0.85)
- Statistically Optimal $K$-means Clustering via Nonnegative Low-rank Semidefinite Programming (ICLR 2024 · similarity 0.84)
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.
