Research map / Learning theory and algorithms / Matrix and tensor methods
Fast recovery from a union of subspaces
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace exact SVD projection with approximate block Krylov SVD (one iteration) in SVP/IHT | low-rank matrix recovery (SVP/IHT) · MIT logo subsampled Fourier measurements | phase transition / probability of recovery | No clear effect |
| replace PROPACK with approximate block Krylov SVD in SVP for matrix completion | low-rank matrix completion (SVP) · symmetric 2048x2048 matrix, rank 50 | running time: about 4-8x faster depending on oversampling ratio | Helped |
Closest papers by meaning
- Lower Bounds on Adaptive Sensing for Matrix Recovery (NeurIPS 2023 · similarity 0.87)
- Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares (NeurIPS 2023 · similarity 0.87)
- Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery (ICML 2025 · similarity 0.87)
- Multi-Subspace Matrix Recovery from Permuted Data (AAAI 2025 · similarity 0.86)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.86)
- A Subspace-Constrained Tyler's Estimator and its Applications to Structure from Motion (CVPR 2024 · similarity 0.85)
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.