Research map / Learning theory and algorithms / Matrix and tensor methods
Square Root Principal Component Pursuit: Tuning-Free Noisy Robust Matrix Recovery
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
- Implicit Bias of Projected Subgradient Method Gives Provable Robust Recovery of Subspaces of Unknown Codimension (ICLR 2022 · similarity 0.89)
- Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery (NeurIPS 2021 · similarity 0.89)
- Support Recovery in Sparse PCA with Incomplete Data (NeurIPS 2022 · similarity 0.89)
- Dual Principal Component Pursuit for Robust Subspace Learning: Theory and Algorithms for a Holistic Approach (ICML 2021 · similarity 0.88)
- Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery (ICML 2025 · similarity 0.88)
- Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity (ICML 2025 · 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.