%0 Journal Article
%T Matrix Completion via Max-Norm Constrained Optimization
%A T. Tony Cai
%A Wen-Xin Zhou
%J Computer Science
%D 2013
%I arXiv
%X Matrix completion has been well studied under the uniform sampling model and the trace-norm regularized methods perform well both theoretically and numerically in such a setting. However, the uniform sampling model is unrealistic for a range of applications and the standard trace-norm relaxation can behave very poorly when the sampling distribution is non-uniform. In this paper we propose and analyze a max-norm constrained empirical risk minimization method for noisy matrix completion under a general sampling model. The optimal rate of convergence is established under the Frobenius norm loss in the context of approximately low-rank matrix reconstruction. It is shown that the max-norm constrained method is minimax rate-optimal and it yields a uni?ed and robust approximate recovery guarantee, with respect to the sampling distributions. The computational effectiveness of this method is also studied, based on a first-order algorithm for solving convex programs involving a max-norm constraint.
%U http://arxiv.org/abs/1303.0341v2