Research map / Learning theory and algorithms / Clustering
Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling
Mariano Tepper, Anirvan M. Sengupta, Dmitri Chklovskii
Read the paperCheck your idea against 137,217 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
- Scalable Second-order Riemannian Optimization for $K$-means Clustering (ICLR 2026 · similarity 0.89)
- Large Scale Manifold Balanced Clustering (ICML 2026 · similarity 0.88)
- Self-Supervised Graph Embedding Clustering (TPAMI 2025 · similarity 0.88)
- Statistically Optimal $K$-means Clustering via Nonnegative Low-rank Semidefinite Programming (ICLR 2024 · similarity 0.88)
- Unified K-Means Clustering with Label-Guided Manifold Learning (ICML 2025 · similarity 0.88)
- Geometric Analysis of Nonlinear Manifold Clustering (NeurIPS 2024 · similarity 0.87)
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.
