Low-rank Matrix Completion (LRMC) describes the problem where we wish to recover missing entries of partially observed low-rank matrix. Most existing matrix completion work deals with sampling procedures that are independent of the underlying data values. While this assumption allows the derivation of nice theoretical guarantees, it seldom holds in real-world applications. In this paper, we consider various settings where the sampling mask is dependent on the underlying data values, motivated by applications in sensing, sequential decision-making, and recommender systems. Through a series of experiments, we study and compare the performance of various LRMC algorithms that were originally successful for data-independent sampling patterns.
View on arXiv@article{naik2025_2504.09873,
title={ Truncated Matrix Completion - An Empirical Study },
author={ Rishhabh Naik and Nisarg Trivedi and Davoud Ataee Tarzanagh and Laura Balzano },
journal={arXiv preprint arXiv:2504.09873},
year={ 2025 }
}