Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery

by   Jicong Fan, et al.

This paper develops a new class of nonconvex regularizers for low-rank matrix recovery. Many regularizers are motivated as convex relaxations of the matrix rank function. Our new factor group-sparse regularizers are motivated as a relaxation of the number of nonzero columns in a factorization of the matrix. These nonconvex regularizers are sharper than the nuclear norm; indeed, we show they are related to Schatten-p norms with arbitrarily small 0 < p ≤ 1. Moreover, these factor group-sparse regularizers can be written in a factored form that enables efficient and effective nonconvex optimization; notably, the method does not use singular value decomposition. We provide generalization error bounds for low-rank matrix completion which show improved upper bounds for Schatten-p norm reglarization as p decreases. Compared to the max norm and the factored formulation of the nuclear norm, factor group-sparse regularizers are more efficient, accurate, and robust to the initial guess of rank. Experiments show promising performance of factor group-sparse regularization for low-rank matrix completion and robust principal component analysis.


page 1

page 2

page 3

page 4


Efficient Low-Rank Matrix Learning by Factorizable Nonconvex Regularization

Matrix learning is at the core of many machine learning problems. To enc...

Low-Rank Tensor Recovery with Euclidean-Norm-Induced Schatten-p Quasi-Norm Regularization

The nuclear norm and Schatten-p quasi-norm of a matrix are popular rank ...

Provable Low Rank Plus Sparse Matrix Separation Via Nonconvex Regularizers

This paper considers a large class of problems where we seek to recover ...

Column ℓ_2,0-norm regularized factorization model of low-rank matrix recovery and its computation

This paper is concerned with the column ℓ_2,0-regularized factorization ...

Nonconvex Regularization Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learning

In the past decade, sparse and low-rank recovery have drawn much attenti...

A Group Norm Regularized LRR Factorization Model for Spectral Clustering

Spectral clustering is a very important and classic graph clustering met...

Image Tag Completion by Low-rank Factorization with Dual Reconstruction Structure Preserved

A novel tag completion algorithm is proposed in this paper, which is des...

Please sign up or login with your details

Forgot password? Click here to reset