Research map / Learning theory and algorithms / Clustering
Low-Rank Riemannian Optimization for Graph-Based Clustering Applications
Ahmed Douik, Babak Hassibi
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
- Low-Rank Riemannian Optimization on Positive Semidefinite Stochastic Matrices with Applications to Graph Clustering (ICML 2018 · similarity 0.97)
- Scalable Second-order Riemannian Optimization for $K$-means Clustering (ICLR 2026 · similarity 0.92)
- Approximation Scheme for Weighted Metric Clustering via Sherali-Adams (AAAI 2024 · similarity 0.86)
- Riemannian coordinate descent algorithms on matrix manifolds (ICML 2024 · similarity 0.86)
- Pass-Efficient Algorithms for Graph Spectral Clustering (Student Abstract) (AAAI 2024 · similarity 0.86)
- Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method (ICML 2025 · similarity 0.86)
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.
