Rank penalized estimators for high-dimensional matrices

Details Rank penalized estimators for high-dimensional matrices Rank penalized estimators for high-dimensional matrices

2011-04-07

arxiv.org/abs/1104.1244v2

Mathematics

Statistics Theory

We added a new section on matrix regression

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Rank penalized estimators for high-dimensional matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rank penalized estimators for high-dimensional matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rank penalized estimators for high-dimensional matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-717733