Nuclear norm penalization and optimal rates for noisy low rank matrix completion

Details Nuclear norm penalization and optimal rates for noisy low rank matrix completion Nuclear norm penalization and optimal rates for noisy low rank matrix completion

2010-11-29

arxiv.org/abs/1011.6256v3

Mathematics

Statistics Theory

Scientific paper

This paper deals with the trace regression model where $n$ entries or linear combinations of entries of an unknown $m_1\times m_2$ matrix $A_0$ corrupted by noise are observed. We propose a new nuclear norm penalized estimator of $A_0$ and establish a general sharp oracle inequality for this estimator for arbitrary values of $n,m_1,m_2$ under the condition of isometry in expectation. Then this method is applied to the matrix completion problem. In this case, the estimator admits a simple explicit form and we prove that it satisfies oracle inequalities with faster rates of convergence than in the previous works. They are valid, in particular, in the high-dimensional setting $m_1m_2\gg n$. We show that the obtained rates are optimal up to logarithmic factors in a minimax sense and also derive, for any fixed matrix $A_0$, a non-minimax lower bound on the rate of convergence of our estimator, which coincides with the upper bound up to a constant factor. Finally, we show that our procedure provides an exact recovery of the rank of $A_0$ with probability close to 1. We also discuss the statistical learning setting where there is no underlying model determined by $A_0$ and the aim is to find the best trace regression model approximating the data.

Affiliated with

Also associated with

No associations

Rating

Nuclear norm penalization and optimal rates for noisy low rank matrix completion 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 Nuclear norm penalization and optimal rates for noisy low rank matrix completion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nuclear norm penalization and optimal rates for noisy low rank matrix completion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221209