Research map / Learning theory and algorithms / Matrix and tensor methods
Efficient Convex Relaxations for Streaming PCA
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
- Stochastic PCA with $\ell_2$ and $\ell_1$ Regularization (ICML 2018 · similarity 0.95)
- Oja's Algorithm for Streaming Sparse PCA (NeurIPS 2024 · similarity 0.88)
- Efficient Sparse PCA via Block-Diagonalization (ICLR 2025 · similarity 0.87)
- Low Precision Streaming PCA (NeurIPS 2025 · similarity 0.87)
- Rethinking PCA Through Duality (NeurIPS 2025 · similarity 0.86)
- Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity (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.