Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method

by   Minhui Huang, et al.

Robust low-rank matrix completion (RMC), or robust principal component analysis with partially observed data, has been studied extensively for computer vision, signal processing and machine learning applications. This problem aims to decompose a partially observed matrix into the superposition of a low-rank matrix and a sparse matrix, where the sparse matrix captures the grossly corrupted entries of the matrix. A widely used approach to tackle RMC is to consider a convex formulation, which minimizes the nuclear norm of the low-rank matrix (to promote low-rankness) and the l1 norm of the sparse matrix (to promote sparsity). In this paper, motivated by some recent works on low-rank matrix completion and Riemannian optimization, we formulate this problem as a nonsmooth Riemannian optimization problem over Grassmann manifold. This new formulation is scalable because the low-rank matrix is factorized to the multiplication of two much smaller matrices. We then propose an alternating manifold proximal gradient continuation (AManPGC) method to solve the proposed new formulation. The convergence rate of the proposed algorithm is rigorously analyzed. Numerical results on both synthetic data and real data on background extraction from surveillance videos are reported to demonstrate the advantages of the proposed new formulation and algorithm over several popular existing approaches.


page 1

page 8

page 9


Exploiting the structure effectively and efficiently in low rank matrix recovery

Low rank model arises from a wide range of applications, including machi...

A Saddle Point Approach to Structured Low-rank Matrix Learning

We propose a novel optimization approach for learning a low-rank matrix ...

Splitting numerical integration for matrix completion

Low rank matrix approximation is a popular topic in machine learning. In...

Practical Matrix Completion and Corruption Recovery using Proximal Alternating Robust Subspace Minimization

Low-rank matrix completion is a problem of immense practical importance....

Fast Optimization Algorithm on Riemannian Manifolds and Its Application in Low-Rank Representation

The paper addresses the problem of optimizing a class of composite funct...

Regularization for Matrix Completion

We consider the problem of reconstructing a low rank matrix from noisy o...

Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach

We study the Sparse Plus Low Rank decomposition problem (SLR), which is ...