atlas

Research map / Learning theory and algorithms / Clustering

Learning-Augmented $k$-means Clustering

ICLR 2022 · Learning theory and algorithms › Clustering · approach: k-means++ seeding analysis · 3 citations (OpenAlex)

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 changedWhereMeasuredEffect
Process neural-network predictor labels with the learning-augmented algorithmCIFAR-10 clustering · CIFAR-10normalized clustering cost: 0.733 -> 0.697Helped
Use kmeans++ labels as the predictor and process them with the learning-augmented algorithmCIFAR-10 clustering · CIFAR-10normalized clustering cost: 0.640; 13% betterHelped
Apply the learning-augmented algorithm to Graph #1 predictor labelsOregon spectral clustering, k=10 · Oregon graph embeddings, k=10clustering cost: 55%Helped
Process randomly corrupted labels with the learning-augmented algorithmPHY clustering · PHYclustering cost: roughly a factor of 3xHelped
Increase random label corruptionOregon Graph #5 predictor · Oregon Graph #5, k=10clustering costMixed
Use fewer queried predictor labelsLearning-augmented algorithm · CIFAR-10clustering costMixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy