A Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms

12/02/2010
by   Zhouchen Lin, et al.
0

Recent years have witnessed the popularity of using rank minimization as a regularizer for various signal processing and machine learning problems. As rank minimization problems are often converted to nuclear norm minimization (NNM) problems, they have to be solved iteratively and each iteration requires computing a singular value decomposition (SVD). Therefore, their solution suffers from the high computation cost of multiple SVDs. To relieve this issue, we propose using the block Lanczos method to compute the partial SVDs, where the principal singular subspaces obtained in the previous iteration are used to start the block Lanczos procedure. To avoid the expensive reorthogonalization in the Lanczos procedure, the block Lanczos procedure is performed for only a few steps. Our block Lanczos with warm start (BLWS) technique can be adopted by different algorithms that solve NNM problems. We present numerical results on applying BLWS to Robust PCA and Matrix Completion problems. Experimental results show that our BLWS technique usually accelerates its host algorithm by at least two to three times.

READ FULL TEXT
research
09/01/2015

Fast Randomized Singular Value Thresholding for Low-rank Optimization

Rank minimization can be converted into tractable surrogate problems, su...
research
11/09/2020

Tensor Completion via Tensor QR Decomposition and L_2,1-Norm Minimization

In this paper, we consider the tensor completion problem, which has many...
research
05/19/2017

Fast Singular Value Shrinkage with Chebyshev Polynomial Approximation Based on Signal Sparsity

We propose an approximation method for thresholding of singular values u...
research
06/04/2016

Scalable Algorithms for Tractable Schatten Quasi-Norm Minimization

The Schatten-p quasi-norm (0<p<1) is usually used to replace the standar...
research
08/06/2021

Fast and Accurate Low-Rank Tensor Completion Methods Based on QR Decomposition and L_2,1 Norm Minimization

More recently, an Approximate SVD Based on Qatar Riyal (QR) Decompositio...
research
03/07/2012

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

Given a limited number of entries from the superposition of a low-rank m...
research
04/13/2017

Projection Free Rank-Drop Steps

The Frank-Wolfe (FW) algorithm has been widely used in solving nuclear n...

Please sign up or login with your details

Forgot password? Click here to reset