Research map / Learning theory and algorithms / Matrix and tensor methods
Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packing
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
- Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA (ICML 2023 · similarity 0.89)
- Efficient Sparse PCA via Block-Diagonalization (ICLR 2025 · similarity 0.88)
- Robust Gaussian Covariance Estimation in Nearly-Matrix Multiplication Time (NeurIPS 2020 · similarity 0.88)
- Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity (ICML 2025 · similarity 0.87)
- Oja's Algorithm for Streaming Sparse PCA (NeurIPS 2024 · similarity 0.86)
- An Iterative Algorithm for Differentially Private $k$-PCA with Adaptive Noise (NeurIPS 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.