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

Celý popis

Podrobná bibliografia

Vydané v:	Electronic journal of statistics Ročník 9; číslo 2; s. 2348 - 2369
Hlavný autor:	Klopp, Olga
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Shaker Heights, OH : Institute of Mathematical Statistics 01.01.2015
Predmet:	Mathematics Statistics low rank matrix estimation 60B20 15A83 matrix completion 62H12 minimax opti-mality AMS 2000 subject classification: 62J99
ISSN:	1935-7524, 1935-7524
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!