Learning of Generalized Low-Rank Models: A Greedy Approach
arXiv:1607.08012
Abstract
Learning of low-rank matrices is fundamental to many machine learning applications. A state-of-the-art algorithm is the rank-one matrix pursuit (R1MP). However, it can only be used in matrix completion problems with the square loss. In this paper, we develop a more flexible greedy algorithm for generalized low-rank models whose optimization objective can be smooth or nonsmooth, general convex or strongly convex. The proposed algorithm has low per-iteration time complexity and fast convergence rate. Experimental results show that it is much faster than the state-of-the-art, with comparable or even better prediction performance.
References in corpus (5)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices
- Large-scale Multi-label Learning with Missing Labels
- Prediction and Clustering in Signed Networks: A Local to Global Perspective
- Fast Low-Rank Matrix Learning with Nonconvex Regularization