Large-Scale Convex Minimization with a Low-Rank Constraint

Details Large-Scale Convex Minimization with a Low-Rank Constraint Large-Scale Convex Minimization with a Low-Rank Constraint

2011-06-08

arxiv.org/abs/1106.1622v1

Computer Science

Learning

ICML 2011

Scientific paper

We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient greedy algorithm and derive its formal approximation guarantees. Each iteration of the algorithm involves (approximately) finding the left and right singular vectors corresponding to the largest singular value of a certain matrix, which can be calculated in linear time. This leads to an algorithm which can scale to large matrices arising in several applications such as matrix completion for collaborative filtering and robust low rank matrix approximation.

Affiliated with

Also associated with

No associations

Rating

Large-Scale Convex Minimization with a Low-Rank Constraint 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 Large-Scale Convex Minimization with a Low-Rank Constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large-Scale Convex Minimization with a Low-Rank Constraint will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-320814