Low-rank optimization with trace norm penalty

Details Low-rank optimization with trace norm penalty Low-rank optimization with trace norm penalty

2011-12-11

arxiv.org/abs/1112.2318v1

Mathematics

Optimization and Control

Scientific paper

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 still maintaining complexity that is linear in the number of rows of the matrix. To compute a set of solutions efficiently for a grid of regularization parameters we propose a predictor-corrector approach on the quotient manifold that outperforms the naive warm-restart approach. The performance of the proposed algorithm is illustrated on problems of low-rank matrix completion and multivariate linear regression.

Affiliated with

Also associated with

No associations

Rating

Low-rank optimization with trace norm penalty does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Low-rank optimization with trace norm penalty, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-rank optimization with trace norm penalty will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-306795