Research map / Learning theory and algorithms / Matrix and tensor methods
Robust Matrix Completion With Deterministic Sampling via Convex Optimization
Yinjian Wang, Wei Li, James E. Fowler, Gemine Vivone
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
- Matrix Completion with Deterministic Sampling: Theories and Methods (TPAMI 2019 · similarity 0.92)
- Nearly Optimal Robust Matrix Completion (ICML 2017 · similarity 0.92)
- Symmetric Matrix Completion with ReLU Sampling (ICML 2024 · similarity 0.90)
- RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees (NeurIPS 2025 · similarity 0.90)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.89)
- Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery (ICML 2025 · similarity 0.88)
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.
