Matrix Completion via Max-Norm Constrained Optimization

03/02/2013
by   T. Tony Cai, et al.
0

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 underlying sampling scheme 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 yields a unified and robust approximate recovery guarantee, with respect to the sampling distributions. The computational effectiveness of this method is also discussed, based on first-order algorithms for solving convex optimizations involving max-norm regularization.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/24/2013

A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion

We consider in this paper the problem of noisy 1-bit matrix completion u...
research
09/24/2016

Max-Norm Optimization for Robust Matrix Recovery

This paper studies the matrix completion problem under arbitrary samplin...
research
02/25/2012

Clustering using Max-norm Constrained Optimization

We suggest using the max-norm as a convex surrogate constraint for clust...
research
04/24/2015

Social Trust Prediction via Max-norm Constrained 1-bit Matrix Completion

Social trust prediction addresses the significant problem of exploring i...
research
02/16/2018

Learning Latent Features with Pairwise Penalties in Matrix Completion

Low-rank matrix completion (MC) has achieved great success in many real-...
research
06/21/2011

Learning with the Weighted Trace-norm under Arbitrary Sampling Distributions

We provide rigorous guarantees on learning with the weighted trace-norm ...
research
09/07/2023

L_2,1-Norm Regularized Quaternion Matrix Completion Using Sparse Representation and Quaternion QR Decomposition

Color image completion is a challenging problem in computer vision, but ...

Please sign up or login with your details

Forgot password? Click here to reset