Exact Matrix Completion via Convex Optimization
| dc.contributor.author | Lotsi, A. | |
| dc.contributor.author | Doku-Amponsah, K. | |
| dc.date.accessioned | 2019-12-24T09:39:48Z | |
| dc.date.available | 2019-12-24T09:39:48Z | |
| dc.date.issued | 2016-03-10 | |
| dc.description | Seminar | en_US |
| dc.description.abstract | We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys for some positive numerical constant C, then with very high probability, most n*n matrices of rank r can be perfectly recovered by solving a simple convex optimization problem. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Our results are connected with the recent literature on compressed sensing, and show that objects other than signals and images can be perfectly reconstructed from very limited information. | en_US |
| dc.identifier.uri | http://ugspace.ug.edu.gh/handle/123456789/34316 | |
| dc.language.iso | en | en_US |
| dc.subject | Matrix Completion | en_US |
| dc.subject | Convex Optimization | en_US |
| dc.subject | matrix M | en_US |
| dc.subject | convex optimization problem | en_US |
| dc.title | Exact Matrix Completion via Convex Optimization | en_US |
| dc.type | Article | en_US |
Files
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.6 KB
- Format:
- Item-specific license agreed upon to submission
- Description: