# Information-Guided Sampling for Low-Rank Matrix Completion

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

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Jun 2017.

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

- [Adaptive Sampling for Discovery](https://mlsanity.com/paper/2205.14829/) (2022)
- [CoreFlow: Low-Rank Matrix Generative Models](https://mlsanity.com/paper/2604.24959/) (2026)

## Abstract (arXiv)

The noisy matrix completion problem, which aims to recover a low-rank matrix X from a partial, noisy observation of its entries, arises in many statistical, machine learning, and engineering applications. In this paper, we present a new, information-theoretic approach for active sampling (or designing) of matrix entries for noisy matrix completion, based on the maximum entropy design principle. One novelty of our method is that it implicitly makes use of uncertainty quantification (UQ) -- a measure of uncertainty for unobserved matrix entries -- to guide the active sampling procedure. The proposed framework reveals several novel insights on the role of compressive sensing (e.g., coherence) and coding design (e.g., Latin squares) on the sampling performance and UQ for noisy matrix completion. Using such insights, we develop an efficient posterior sampler for UQ, which is then used to guide a closed-form sampling scheme for matrix entries. Finally, we illustrate the effectiveness of this integrated sampling / UQ methodology in simulation studies and two applications to collaborative filtering.