Randomized Approach to Matrix Completion: Applications in Collaborative Filtering and Image Inpainting
We present a novel method for matrix completion, specifically designed for matrices where one dimension significantly exceeds the other. Our Columns Selected Matrix Completion (CSMC) method combines Column Subset Selection and Low-Rank Matrix Completion to efficiently reconstruct incomplete datasets. In each step, CSMC solves a convex optimization problem. We introduce two algorithms to implement CSMC, each tailored to problems of different sizes. A formal analysis is provided, outlining the necessary assumptions and the probability of obtaining a correct solution. To assess the impact of matrix size, rank, and the ratio of missing entries on solution quality and computation time, we conducted experiments on synthetic data. The method was also applied to two real-world problems: recommendation systems and image inpainting. Our results show that CSMC provides solutions of the same quality as state-of-the-art matrix completion algorithms based on convex optimization, while achieving significant reductions in computational runtime.
Code (1)
Tasks
Collaborative FilteringImage InpaintingLow-Rank Matrix CompletionMatrix CompletionMissing ElementsRecommendation SystemsSimilar Papers 제목 키워드 기반
Efficient Model-Based Collaborative Filtering with Fast Adaptive PCA
A model-based collaborative filtering (CF) approach utilizing fast adaptive randomized singular value decomposition (SVD) is proposed for the matrix completion problem in recommender system. Firstly, a fast adaptive PCA …
Collaborative FilteringMatrix CompletionRecommendation SystemsAdaptive Matrix Completion for the Users and the Items in Tail
Recommender systems are widely used to recommend the most appealing items to users. These recommendations can be generated by applying collaborative filtering methods. The low-rank matrix completion method is the state-o…
Collaborative FilteringLow-Rank Matrix CompletionMatrix CompletionRecommendation SystemsRecommendation via matrix completion using Kolmogorov complexity
A usual way to model a recommendation system is as a matrix completion problem. There are several matrix completion methods, typically using optimization approaches or collaborative filtering. Most approaches assume that…
Collaborative FilteringMatrix CompletionRecommendation SystemsA Generalized Latent Factor Model Approach to Mixed-data Matrix Completion with Entrywise Consistency
Matrix completion is a class of machine learning methods that concerns the prediction of missing entries in a partially observed matrix. This paper studies matrix completion for mixed data, i.e., data involving mixed typ…
Collaborative FilteringMatrix CompletionCollaborative Filtering with Graph Information: Consistency and Scalable Methods
Low rank matrix completion plays a fundamental role in collaborative filtering applications, the key idea being that the variables lie in a smaller subspace than the ambient space. Often, additional information about the…
Collaborative FilteringLow-Rank Matrix CompletionMatrix CompletionRecommendation Systems