Matrix completion by singular value thresholding: Sharp bounds
We consider the matrix completion problem where the aim is to esti-mate a large data matrix for which only a relatively small random subset of its entries is observed. Quite popular approaches to matrix completion problem are iterative thresholding methods. In spite of their empirical success, the t...
Saved in:
| Published in: | Electronic journal of statistics Vol. 9; no. 2; pp. 2348 - 2369 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Shaker Heights, OH : Institute of Mathematical Statistics
01.01.2015
|
| Subjects: | |
| ISSN: | 1935-7524, 1935-7524 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We consider the matrix completion problem where the aim is to esti-mate a large data matrix for which only a relatively small random subset of its entries is observed. Quite popular approaches to matrix completion problem are iterative thresholding methods. In spite of their empirical success, the theoretical guarantees of such iterative thresholding methods are poorly understood. The goal of this paper is to provide strong theo-retical guarantees, similar to those obtained for nuclear-norm penalization methods and one step thresholding methods, for an iterative thresholding algorithm which is a modification of the softImpute algorithm. An im-portant consequence of our result is the exact minimax optimal rates of convergence for matrix completion problem which were known until know only up to a logarithmic factor. |
|---|---|
| ISSN: | 1935-7524 1935-7524 |
| DOI: | 10.1214/15-EJS1076 |