AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Near-Optimal Quantum Coreset Construction Algorithms for Clustering

Yecheng Xue, Xiaoyu Chen, Tongyang Li, Shaofeng H.-C. Jiang

ICML 2023 · Learning theory and algorithms › Clustering · approach: Coresets and dynamic clustering · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
Quantum LSH-based approximate nearest neighbor search used in the bicriteria step instead of exact nearest-neighbor computationk-clustering coreset construction · k-median/k-means coresetquery complexityImproved
Quantum multidimensional approximate summation / counting used to compute per-cluster costs simultaneously instead of classical O(nk) per-point distance sumscoreset construction · k-clustering in R^dquery complexityImproved
Adding an approximate-counting trick that estimates large parts first and leaves small parts for later iterationsmultidimensional quantum counting · partition countingquery complexityNo clear effect

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