Noisy low-rank matrix completion with general sampling distribution
In the present paper we consider the problem of matrix completion with noise for general sampling schemes. Unlike previous works, in our construction we do not need to know or to evaluate the sampling distribution or the variance of the noise. We propose new nuclear-norm penalized estimators, one of them of the ''square-root'' type. We prove that, up to a logarithmic factor, our estimators achieve optimal rates with respect to the estimation error.