Research map / Learning theory and algorithms / Matrix and tensor methods
Compact Matrix Factorization With Dependent Subspaces
Check 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Combine local subspace constraints with a global rank constraint | matrix completion · Paper sequence, missing points | reconstruction error: 3.27e3 -> 2.86e2 | Helped |
| Combine local subspace constraints with a global rank constraint | matrix completion · Back sequence, missing points | reconstruction error: 1.9e3 -> 1.4e3 | Helped |
| Combine local subspace constraints with a global rank constraint | matrix completion · Heart sequence, missing points | reconstruction error: 4.4e3 -> 3.6e3 | Helped |
| Use the unified model instead of independent local subspaces | matrix completion · Paper sequence, missing points | reconstruction error: 2.79e4 -> 2.86e2 | Helped |
| Use the unified model instead of independent local subspaces | matrix completion · Back sequence, missing points | reconstruction error: 1.1e5 -> 1.4e3 | Helped |
| Use the unified model instead of independent local subspaces | matrix completion · Heart sequence, missing points | reconstruction error: 2.2e5 -> 3.6e3 | Helped |
| Use the unified model instead of the global model | matrix completion · Paper sequence, visible points | reconstruction error: 3.95e1 -> 1.07e2 | Hurt |
| Use the unified model instead of the global model | matrix completion · Back sequence, visible points | reconstruction error: 5.3e2 -> 6.9e2 | Hurt |
| Use the unified model instead of the global model | matrix completion · Heart sequence, visible points | reconstruction error: 1.1e3 -> 1.5e3 | Hurt |
| Use the proposed factorization rather than the strongest reported baseline | Hopkins155 matrix completion · tracking failure | successful instances: 88 (56.8%) -> 148 (95.5%) | Helped |
| Use the proposed factorization rather than competing methods | Hopkins155 matrix completion · uniform missing entries | successful instances | No clear effect |
Closest papers by meaning
- Trust No One: Low Rank Matrix Factorization Using Hierarchical RANSAC (CVPR 2016 · similarity 0.89)
- High-Rank Matrix Completion and Clustering under Self-Expressive Models (NeurIPS 2016 · similarity 0.88)
- Leveraging Union of Subspace Structure to Improve Constrained Clustering (ICML 2017 · similarity 0.87)
- A Pairwise Pseudo-likelihood Approach for Matrix Completion with Informative Missingness (NeurIPS 2024 · similarity 0.87)
- Connectivity Shapes Implicit Regularization in Matrix Factorization Models for Matrix Completion (NeurIPS 2024 · similarity 0.86)
- A Subspace-Constrained Tyler's Estimator and its Applications to Structure from Motion (CVPR 2024 · similarity 0.86)
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.