New Algorithms for the Learning-Augmented k-means Problem

Junyu Huang, Qilong Feng, Ziyun Huang, Zhen Zhang, Jinhui Xu +1 more
2/12/2026

No confident code implementation found for this paper. 1 possible match can be shown below.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

SFESS: Score Function Estimators for k-Subset Sampling

86% match1 repo42026

Fast Algorithms for Distributed k-Clustering with Outliers

85% match2026

Faster Query Times for Fully Dynamic k-Center Clustering with Outliers

84% match2026

Geometric Median (GM) Matching for Robust k-Subset Selection from Noisy Data

84% match2026

Analyzing Dα seeding for k-means

82% match2026

Average Sensitivity of Hierarchical k-Median Clustering

82% match2026

Cite this paper

@article{huang2026algorithms,
  title  = {New Algorithms for the Learning-Augmented k-means Problem},
  author = {Junyu Huang and Qilong Feng and Ziyun Huang and Zhen Zhang and Jinhui Xu and Jianxin Wang},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:4a131bcf0aa5132a1d20bef6d502ba2f4adeabfb},
  journal = {ICLR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/4a131bcf0aa5132a1d20bef6d502ba2f4adeabfb.svg)](https://codeofpaper.com/paper/4a131bcf0aa5132a1d20bef6d502ba2f4adeabfb)

Discussion