Research map / Learning theory and algorithms / Clustering
Scalable Second-order Riemannian Optimization for $K$-means Clustering
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
- Low-Rank Riemannian Optimization on Positive Semidefinite Stochastic Matrices with Applications to Graph Clustering (ICML 2018 · similarity 0.90)
- Statistically Optimal $K$-means Clustering via Nonnegative Low-rank Semidefinite Programming (ICLR 2024 · similarity 0.90)
- Near-Optimal Private and Scalable $k$-Clustering (NeurIPS 2022 · similarity 0.88)
- An Efficient Semismooth Newton based Algorithm for Convex Clustering (ICML 2018 · similarity 0.88)
- Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems (ICLR 2025 · similarity 0.87)
- Approximation Scheme for Weighted Metric Clustering via Sherali-Adams (AAAI 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.