DeepAI AI Chat
Log In Sign Up

Non-Convex Rank Minimization via an Empirical Bayesian Approach

by   David Wipf, et al.

In many applications that require matrix solutions of minimal rank, the underlying cost function is non-convex leading to an intractable, NP-hard optimization problem. Consequently, the convex nuclear norm is frequently used as a surrogate penalty term for matrix rank. The problem is that in many practical scenarios there is no longer any guarantee that we can correctly estimate generative low-rank matrices of interest, theoretical special cases notwithstanding. Consequently, this paper proposes an alternative empirical Bayesian procedure build upon a variational approximation that, unlike the nuclear norm, retains the same globally minimizing point estimate as the rank function under many useful constraints. However, locally minimizing solutions are largely smoothed away via marginalization, allowing the algorithm to succeed when standard convex relaxations completely fail. While the proposed methodology is generally applicable to a wide range of low-rank applications, we focus our attention on the robust principal component analysis problem (RPCA), which involves estimating an unknown low-rank matrix with unknown sparse corruptions. Theoretical and empirical evidence are presented to show that our method is potentially superior to related MAP-based approaches, for which the convex principle component pursuit (PCP) algorithm (Candes et al., 2011) can be viewed as a special case.


page 1

page 2

page 3

page 4


Visual Processing by a Unified Schatten-p Norm and ℓ_q Norm Regularized Principal Component Pursuit

In this paper, we propose a non-convex formulation to recover the authen...

Improved Sparse Low-Rank Matrix Estimation

We address the problem of estimating a sparse low-rank matrix from its n...

Low-Rank Factorization for Rank Minimization with Nonconvex Regularizers

Rank minimization is of interest in machine learning applications such a...

Robust PCA via Nonconvex Rank Approximation

Numerous applications in data mining and machine learning require recove...

Informed Non-convex Robust Principal Component Analysis with Features

We revisit the problem of robust principal component analysis with featu...

Efficient Online Minimization for Low-Rank Subspace Clustering

Low-rank representation (LRR) has been a significant method for segmenti...

In-network Sparsity-regularized Rank Minimization: Algorithms and Applications

Given a limited number of entries from the superposition of a low-rank m...