We study the frequent problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving {\\em weighted} low rank approximation problems, which, unlike simple matrix factorization problems, do not admit a closed form solution in general. We analyze, in addition, the nature of locally optimal solutions that arise in this context, demonstrate the utility of accommodating the weights in reconstructing the underlying low rank representation, and extend the formulation to non-Gaussian noise models such as classification (collaborative filtering).
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/6708 |
| Date | 15 January 2003 |
| Creators | Srebro, Nathan, Jaakkola, Tommi |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 10 p., 2061103 bytes, 911431 bytes, application/postscript, application/pdf |
| Relation | AIM-2003-001 |
Page generated in 0.0019 seconds