Research map / Learning theory and algorithms / Clustering
Randomized Sketches for Clustering: Fast and Optimal Kernel $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
- Refined Learning Bounds for Kernel and Approximate $k$-Means (NeurIPS 2021 · similarity 0.89)
- Distributed Randomized Sketching Kernel Learning (AAAI 2022 · similarity 0.88)
- Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming (NeurIPS 2023 · similarity 0.87)
- Enhancing Kernel Power $K$-means: Scalable and Robust Clustering with Random Fourier Features and Possibilistic Method (AAAI 2026 · similarity 0.87)
- Near-Linear Time Approximation Algorithms for k-means with Outliers (ICML 2024 · similarity 0.85)
- Scalable Multiple Kernel Clustering: Learning Clustering Structure from Expectation (ICML 2024 · 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.