Learning Latent Features with Pairwise Penalties in Low-Rank Matrix Completion
arXiv:1802.05821
Abstract
Low-rank matrix completion has achieved great success in many real-world data applications. A matrix factorization model that learns latent features is usually employed and, to improve prediction performance, the similarities between latent variables can be exploited by pairwise learning using the graph regularized matrix factorization (GRMF) method. However, existing GRMF approaches often use the squared loss to measure the pairwise differences, which may be overly influenced by dissimilar pairs and lead to inferior prediction. To fully empower pairwise learning for matrix completion, we propose a general optimization framework that allows a rich class of (non-)convex pairwise penalty functions. A new and efficient algorithm is developed to solve the proposed optimization problem, with a theoretical convergence guarantee under mild assumptions. In an important situation where the latent variables form a small number of subgroups, its statistical guarantee is also fully considered. In particular, we theoretically characterize the performance of the complexity-regularized maximum likelihood estimator, as a special case of our framework, which is shown to have smaller errors when compared to the standard matrix completion framework without pairwise penalties. We conduct extensive experiments on both synthetic and real datasets to demonstrate the superior performance of this general framework.
References in corpus (7)
- Nearly unbiased variable selection under minimax concave penalty
- An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors
- Bregman Alternating Direction Method of Multipliers
- Matrix Completion on Graphs
- Noisy Matrix Completion under Sparse Factor Models
- Vector-Valued Graph Trend Filtering with Non-Convex Penalties
- Family Shopping Recommendation System Using User Profile and Behavior Data