# On the Power of Adaptivity in Matrix Completion and Approximation

arXiv: https://arxiv.org/abs/1407.3619 · HTML: https://mlsanity.com/paper/1407.3619/

## Key facts

- Cited by 7 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Jul 2014.

## Built on by (most cited first, 7 of 7)

- [Lifelong Matrix Completion with Sparsity-Number](https://mlsanity.com/paper/2203.07637/) (2022)
- [Adaptive Noisy Matrix Completion](https://mlsanity.com/paper/2203.08340/) (2022)
- [Matrix Completion with Heterogonous Cost](https://mlsanity.com/paper/2203.12120/) (2022)
- [Survey of Matrix Completion Algorithms](https://mlsanity.com/paper/2204.01532/) (2022)
- [NoisyCUR: An algorithm for two-cost budgeted matrix completion](https://mlsanity.com/paper/2104.08026/) (2021)
- [Matrix Completion with Sparse Noisy Rows](https://mlsanity.com/paper/2204.01530/) (2022)
- [Randomized Approach to Matrix Completion: Applications in Recommendation Systems and Image Inpainting](https://mlsanity.com/paper/2403.01919/) (2024)

## Abstract (arXiv)

We consider the related tasks of matrix completion and matrix approximation from missing data and propose adaptive sampling procedures for both problems. We show that adaptive sampling allows one to eliminate standard incoherence assumptions on the matrix row space that are necessary for passive sampling procedures. For exact recovery of a low-rank matrix, our algorithm judiciously selects a few columns to observe in full and, with few additional measurements, projects the remaining columns onto their span. This algorithm exactly recovers an n × n rank r matrix using O(nrμ0 log2(r)) observations, where μ0 is a coherence parameter on the column space of the matrix. In addition to completely eliminating any row space assumptions that have pervaded the literature, this algorithm enjoys a better sample complexity than any existing matrix completion algorithm. To certify that this improvement is due to adaptive sampling, we establish that row space coherence is necessary for passive sampling algorithms to achieve non-trivial sample complexity bounds. For constructing a low-rank approximation to a high-rank input matrix, we propose a simple algorithm that thresholds the singular values of a zero-filled version of the input matrix. The algorithm computes an approximation that is nearly as good as the best rank-r approximation using O(nrμ log2(n)) samples, where μ is a slightly different coherence parameter on the matrix columns. Again we eliminate assumptions on the row space.