Research map / Learning theory and algorithms / Matrix and tensor methods
Iteratively Reweighted Minimax-Concave Penalty Minimization for Accurate Low-rank Plus Sparse Matrix Decomposition
Praveen Kumar Pokala, Raghu Vamshi Hemadri, Chandra Sekhar Seelamantula
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
- Iteratively Capped Reweighting Norm Minimization With Global Convergence Guarantee for Low-Rank Matrix Learning (TPAMI 2024 · similarity 0.88)
- Large-Scale Low-Rank Matrix Learning with Nonconvex Regularizers (TPAMI 2018 · similarity 0.87)
- Recovery guarantee of weighted low-rank approximation via alternating minimization (ICML 2016 · similarity 0.87)
- Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descent (JMLR 2021 · similarity 0.86)
- Reweighted Solutions for Weighted Low Rank Approximation (ICML 2024 · similarity 0.85)
- Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation (ICLR 2025 · similarity 0.85)
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.
