Research map / Learning theory and algorithms / Matrix and tensor methods
Scalable Completion of Nonnegative Matrix with Separable Structure
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
- Online High Rank Matrix Completion (CVPR 2019 · similarity 0.91)
- A Pairwise Pseudo-likelihood Approach for Matrix Completion with Informative Missingness (NeurIPS 2024 · similarity 0.91)
- High Rank Matrix Completion With Side Information (AAAI 2018 · similarity 0.91)
- Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm Assumption (NeurIPS 2019 · similarity 0.90)
- RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees (NeurIPS 2025 · similarity 0.89)
- Symmetric Matrix Completion with ReLU Sampling (ICML 2024 · similarity 0.89)
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.