A novel ℓp-greedy pursuit (GP) algorithm for robust matrix completion, i.e., recovering a low-rank matrix from only a subset of its noisy and outlier-contaminated entries, is de- vised. The ℓp-GP uses the strategy of sequential rank-one update.

The ℓ p -GP uses the strategy of sequential rank-one update. In each iteration, a rank-one completion is solved by minimizing the ℓ p -norm of the residual.

Their key idea is to exploit the fact that any low-rank matrix can be expressed as a sum of r rank-one matrices, and the most well-known representation is SVD ...

Paper Title, ROBUST MATRIX COMPLETION VIA LP-GREEDY PURSUITS ; Authors, Xue Jiang, Shanghai Jiao Tong University, China; Abdelhak M. Zoubir, Technische ...

An alternating projection algorithm (APA) is devised to find a feasible point in the intersection of the low-rank constraint set and fidelity constraint set ...

Robust Matrix Completion via lP-Greedy Pursuits. 45th International Conference on Acoustics, Speech, and Signal Processing (ICASSP). Barcelona, Spain (May 4 ...

In this paper we introduce an efficient greedy algorithm for such matrix completions. The greedy algorithm generalizes the orthogonal rank-one matrix pursuit ...

Missing: lP- | Show results with:lP-

Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent ... Robust Matrix Completion via ℓ P -Greedy Pursuits. ICASSP ...

People also ask

What are the algorithms for matrix completion?

What is a matrix completion model?

In this paper, we propose RMC, a new method to deal with the problem of robust low-rank matrix completion, i.e., matrix completion where a fraction of the ...

Missing: lP- | Show results with:lP-

1-bit matrix completion refers to the prob- lem of recovering a real-valued low-rank ma- trix from a small fraction of its sign pat- terns. In many real-world ...

Missing: lP- | Show results with:lP-