Advanced Search
DSpace@MIT

Low rank matrix completion

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor Pablo.A.Parrilo. en_US
dc.contributor.author Nan, Feng, S.M. Massachusetts Institute of Technology en_US
dc.contributor.other Massachusetts Institute of Technology. Computation for Design and Optimization Program. en_US
dc.date.accessioned 2010-05-25T20:39:01Z
dc.date.available 2010-05-25T20:39:01Z
dc.date.copyright 2009 en_US
dc.date.issued 2009 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/55077
dc.description Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2009. en_US
dc.description Cataloged from PDF version of thesis. en_US
dc.description Includes bibliographical references (p. 75-76). en_US
dc.description.abstract We consider the problem of recovering a low rank matrix given a sampling of its entries. Such problems are of considerable interest in a diverse set of fields including control, system identification, statistics and signal processing. Although the general low rank matrix completion problem is NP-hard, there exist several heuristic methods that solve the problem approximately by solving the convex relaxation of the original problem. One particularly popular method is to use nuclear norm (sum of singular values) to approximate the rank of the matrix and formulate the problem as a semidefinite program that can be solved efficiently. In this thesis, we propose a local completion algorithm that searches for possible completion in the neighborhood of each unspecified entry given the rank of the matrix. Unlike existing methods, this algorithm requires only local information of the matrix if the rank is known. Critical in all low rank matrix completion algorithms is the sampling density. The denser the matrix is sampled, the more likely it can be recovered accurately. We then propose a condensation process that increases the sampling density in a specific part of the matrix through elementary row and column re-ordering. Hence we can solve a sub-problem of the original low rank matrix completion problem and gain information on the rank of the matrix. Then the local algorithm is readily applicable to recover the entire matrix. We also explore the effect of additional sampling structures on the completion rate of the low rank matrix completion problems. In particular, we show that imposing regularity in the sampling process leads to slightly better completion rates. en_US
dc.description.abstract (cont.) We also provide a new semidefinite formulation for a particular block sampling structure that reduces the size of the constraint matrix sizes by a factor of 1.5. en_US
dc.description.statementofresponsibility by Feng Nan. en_US
dc.format.extent 76 p. en_US
dc.language.iso eng en_US
dc.publisher Massachusetts Institute of Technology en_US
dc.rights M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. en_US
dc.rights.uri http://dspace.mit.edu/handle/1721.1/7582 en_US
dc.subject Computation for Design and Optimization Program. en_US
dc.title Low rank matrix completion en_US
dc.type Thesis en_US
dc.description.degree S.M. en_US
dc.contributor.department Massachusetts Institute of Technology. Computation for Design and Optimization Program. en_US
dc.identifier.oclc 587442816 en_US


Files in this item

Name Size Format Description
587442816.pdf 3.276Mb PDF Preview, non-printable (open to all)
587442816-MIT.pdf 3.276Mb PDF Full printable version (MIT only)

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage