Research map / Learning theory and algorithms / Clustering
Improved Coresets for Euclidean $k$-Means
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 |
|---|---|---|---|
| new analysis avoiding terminal embeddings with chaining | Euclidean k-means coreset · Euclidean k-means | coreset size | Helped |
| same technique applied to k-median | Euclidean k-median coreset · Euclidean k-median | coreset size | Helped |
Closest papers by meaning
- Coreset for Robust Geometric Median: Eliminating Size Dependency on Outliers (NeurIPS 2025 · similarity 0.88)
- Universal Weak Coreset (AAAI 2024 · similarity 0.88)
- Optimal Coresets for Low-Dimensional Geometric Median (ICML 2024 · similarity 0.86)
- Faster Approximation Algorithms for k-Center via Data Reduction (ICML 2025 · similarity 0.86)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.84)
- Simple and Optimal Sublinear Algorithms for Mean Estimation (NeurIPS 2025 · similarity 0.83)
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.