Optimal spectral norm rates for noisy low-rank matrix completion

Details Optimal spectral norm rates for noisy low-rank matrix completion Optimal spectral norm rates for noisy low-rank matrix completion

2011-10-24

arxiv.org/abs/1110.5346v1

Mathematics

Statistics Theory

17 pages

Scientific paper

In this paper we consider 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 establish for the nuclear-norm penalized estimator of $A_0$ introduced in \cite{KLT} a general sharp oracle inequality with the spectral norm for arbitrary values of $n,m_1,m_2$ under an incoherence condition on the sampling distribution $\Pi$ of the observed entries. Then, we apply this method to the matrix completion problem. In this case, we prove that it satisfies an optimal oracle inequality for the spectral norm, thus improving upon the only existing result \cite{KLT} concerning the spectral norm, which assumes that the sampling distribution is uniform. Note that our result is valid, in particular, in the high-dimensional setting $m_1m_2\gg n$. Finally we show that the obtained rate is optimal up to logarithmic factors in a minimax sense.

Affiliated with

Also associated with

No associations

Rating

Optimal spectral norm 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 Optimal spectral norm 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 Optimal spectral norm rates for noisy low-rank matrix completion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-93634