Research map / Learning theory and algorithms / Clustering
Refined Learning Bounds for Kernel and Approximate $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.
Closest papers by meaning
- Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering (ICML 2019 · similarity 0.92)
- Sharper Generalization Bounds for Clustering (ICML 2021 · similarity 0.90)
- On Robustness of Kernel Clustering (NeurIPS 2016 · similarity 0.90)
- Randomized Sketches for Clustering: Fast and Optimal Kernel $k$-Means (NeurIPS 2022 · similarity 0.89)
- Scalable Multiple Kernel Clustering: Learning Clustering Structure from Expectation (ICML 2024 · similarity 0.88)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.85)
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.