Research map / Learning theory and algorithms / Matrix and tensor methods
Robust Matrix Factorization by Majorization Minimization
Zhouchen Lin, Chen Xu, Hongbin Zha
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
- Structured Low-Rank Matrix Factorization: Global Optimality, Algorithms, and Applications (TPAMI 2019 · similarity 0.90)
- Scalable Robust Matrix Factorization with Nonconvex Loss (NeurIPS 2018 · similarity 0.90)
- Bilinear Factor Matrix Norm Minimization for Robust PCA: Algorithms and Applications (TPAMI 2017 · similarity 0.90)
- RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees (NeurIPS 2025 · similarity 0.88)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.87)
- Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery (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.
