Computer Science – Information Theory
Scientific paper
2009-09-15
Computer Science
Information Theory
4+ pages, submitted to ICASSP 2010
Scientific paper
A new algorithm, termed subspace evolution and transfer (SET), is proposed for solving the consistent matrix completion problem. In this setting, one is given a subset of the entries of a low-rank matrix, and asked to find one low-rank matrix consistent with the given observations. We show that this problem can be solved by searching for a column space that matches the observations. The corresponding algorithm consists of two parts -- subspace evolution and subspace transfer. In the evolution part, we use a line search procedure to refine the column space. However, line search is not guaranteed to converge, as there may exist barriers along the search path that prevent the algorithm from reaching a global optimum. To address this problem, in the transfer part, we design mechanisms to detect barriers and transfer the estimated column space from one side of the barrier to the another. The SET algorithm exhibits excellent empirical performance for very low-rank matrices.
Dai Wei
Milenkovic Olgica
No associations
LandOfFree
SET: an algorithm for consistent matrix completion 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 SET: an algorithm for consistent matrix completion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and SET: an algorithm for consistent matrix completion will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-555358