Truncated Matrix Completion - An Empirical Study
By: Rishhabh Naik , Nisarg Trivedi , Davoud Ataee Tarzanagh and more
Potential Business Impact:
Finds missing info in data, even when it's tricky.
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.
Similar Papers
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
Information Retrieval
Helps movie apps suggest better movies for you.
Optimal Transfer Learning for Missing Not-at-Random Matrix Completion
Machine Learning (CS)
Helps predict missing biological data using related info.
Clustering-based Low-Rank Matrix Approximation: An Adaptive Theoretical Analysis with Application to Data Compression
Machine Learning (CS)
Makes medical images smaller without losing detail.