Research map / Learning theory and algorithms / Matrix and tensor methods
Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach
Dimitris Bertsimas, Ryan Cory-Wright, Nicholas A. G. Johnson
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.89)
- Learning-Based Low-Rank Approximations (NeurIPS 2019 · similarity 0.88)
- RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees (NeurIPS 2025 · similarity 0.88)
- Global Convergence of Gradient Descent for Asymmetric Low-Rank Matrix Factorization (NeurIPS 2021 · similarity 0.88)
- Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery (NeurIPS 2019 · similarity 0.88)
- In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting (AAAI 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.
