# Rank penalized estimators for high-dimensional matrices

Abstract : In this paper we consider the trace regression model. Assume that we observe a small set of entries or linear combinations of entries of an unknown matrix $A_0$ corrupted by noise. We propose a new rank penalized estimator of $A_0$. For this estimator we establish general oracle inequality for the prediction error both in probability and in expectation. We also prove upper bounds for the rank of our estimator. Then, we apply our general results to the problems of matrix completion and matrix regression. In these cases our estimator has a particularly simple form: it is obtained by hard thresholding of the singular values of a matrix constructed from the observations.
Keywords :
Domain :

https://hal.archives-ouvertes.fr/hal-00583884
Contributor : Olga Klopp <>
Submitted on : Sunday, September 11, 2011 - 9:18:41 PM
Last modification on : Thursday, March 5, 2020 - 5:51:03 PM
Document(s) archivé(s) le : Monday, December 12, 2011 - 2:22:19 AM

### Files

rang-ejs-ArXiv.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-00583884, version 2
• ARXIV : 1104.1244

### Citation

Olga Klopp. Rank penalized estimators for high-dimensional matrices. Electronic journal of statistics , Shaker Heights, OH : Institute of Mathematical Statistics, 2011, 5, pp.1161-1183. ⟨hal-00583884v2⟩

Record views