NoisyCUR: An Algorithm for Two-Cost Budgeted Matrix Completion

• Published in: Machine Learning and Knowledge Discovery in Databases Vol. 12457; pp. 746 - 761
• Main Authors: Hu, Dong, Gittens, Alex, Magdon-Ismail, Malik
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2021; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Low-rank approximation; Matrix completion; Nuclear norm minimization
• ISBN: 9783030676575; 3030676579
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-67658-2_43

Matrix completion is a ubiquitous tool in machine learning and data analysis. Most work in this area has focused on the number of observations necessary to obtain an accurate low-rank approximation. In practice, however, the cost of observations is an important limiting factor, and experimentalists may have on hand multiple modes of observation with differing noise-vs-cost trade-offs. This paper considers matrix completion subject to such constraints: a budget is imposed and the experimentalist’s goal is to allocate this budget between two sampling modalities in order to recover an accurate low-rank approximation. Specifically, we consider that it is possible to obtain low noise, high cost observations of individual entries or high noise, low cost observations of entire columns. We introduce a regression-based completion algorithm for this setting and experimentally verify the performance of our approach on both synthetic and real data sets. When the budget is low, our algorithm outperforms standard completion algorithms. When the budget is high, our algorithm has comparable error to standard nuclear norm completion algorithms and requires much less computational effort.