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...

Full description

Bibliographic Details

Published in:	Electronic journal of statistics Vol. 9; no. 2; pp. 2348 - 2369
Main Author:	Klopp, Olga
Format:	Journal Article
Language:	English
Published:	Shaker Heights, OH : Institute of Mathematical Statistics 01.01.2015
Subjects:	Mathematics Statistics low rank matrix estimation 60B20 15A83 matrix completion 62H12 minimax opti-mality AMS 2000 subject classification: 62J99
ISSN:	1935-7524, 1935-7524
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!