Research map / Learning theory and algorithms / Matrix and tensor methods
Algebraic Variety Models for High-Rank Matrix Completion
Greg Ongie, Rebecca Willett, Robert D. Nowak, Laura Balzano
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use variety-based matrix completion (VMC) instead of low-rank matrix completion | Synthetic union-of-subspaces data · Synthetic union of subspaces | successful completion rate | Improved |
| Use VMC instead of LRMC or LRMC-NCVX | Synthetic nonlinear variety data · Synthetic parametric curves and surfaces | successful completion rate | Improved |
| Use VMC+SSC instead of LRMC+SSC | Hopkins 155 motion segmentation · Hopkins 155 | clustering error | Mixed |
| Use VMC+SSC instead of SSC-EWZF | Hopkins 155 motion segmentation · Hopkins 155 | clustering error | Improved |
| Use VMC instead of LRMC or LRMC-NCVX | Motion capture completion · CMU Mocap subject 56, trial 6 | completion error | Improved |
| Use polynomial feature degree 2 rather than degree 3 (ablation) | VMC · CMU Mocap subject 56, trial 6, large missing rates | completion error | Improved |
| Use polynomial feature degree 2 rather than degree 3 (ablation) | VMC · CMU Mocap subject 56, trial 6, small missing rates | completion error | No clear effect |
| Use polynomial feature degree 2 or 3 rather than the original-space linear model (ablation) | VMC versus LRMC and LRMC-NCVX · Synthetic union of subspaces | successful completion rate | Improved |
Closest papers by meaning
- Fine-grained Generalization Analysis of Inductive Matrix Completion (NeurIPS 2021 · similarity 0.89)
- Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow (ICML 2018 · similarity 0.89)
- Symmetric Matrix Completion with ReLU Sampling (ICML 2024 · similarity 0.89)
- Generalization Analysis of Deep Non-linear Matrix Completion (ICML 2024 · similarity 0.88)
- RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees (NeurIPS 2025 · similarity 0.87)
- Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time (ICLR 2024 · 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.
