Low-rank optimization with trace norm penalty
arXiv:1112.2318
Abstract
The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equipped with a particular Riemannian structure that leads to efficient computations. We present a second-order trust-region algorithm with a guaranteed quadratic rate of convergence. Overall, the proposed optimization scheme converges super-linearly to the global solution while maintaining complexity that is linear in the number of rows and columns of the matrix. To compute a set of solutions efficiently for a grid of regularization parameters we propose a predictor-corrector approach that outperforms the naive warm-restart approach on the fixed-rank quotient manifold. The performance of the proposed algorithm is illustrated on problems of low-rank matrix completion and multivariate linear regression.
arXiv commentSubmitted
References in corpus (7)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion
- Consistency of trace norm minimization
- Guaranteed Rank Minimization via Singular Value Projection
- Low-rank optimization for distance matrix completion
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- Regularization for Matrix Completion