Reweighted Quasi Norm Regularized Low-Rank Factorization for Matrix Robust PCA
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913286342049792 |
|---|---|
| author | Qin, Zhenzhi Zhang, Liping |
| author_facet | Qin, Zhenzhi Zhang, Liping |
| contents | Robust Principal Component Analysis (RPCA) and its associated non-convex relaxation methods constitute a significant component of matrix completion problems, wherein matrix factorization strategies effectively reduce dimensionality and enhance computational speed. However, some non-convex factorization forms lack theoretical guarantees. This paper proposes a novel strategy in non-convex quasi-norm representation, introducing a method to obtain weighted matrix quasi-norm factorization forms. Especially, explicit bilinear factor matrix factorization formulations for the weighted logarithmic norm and weighted Schatten-$q$ quasi norms with $q=1, 1/2, 2/3$ are provided, along with the establishment of corresponding matrix completion models. An Alternating Direction Method of Multipliers (ADMM) framework algorithm is employed for solving, and convergence results of the algorithm are presented. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_18400 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Reweighted Quasi Norm Regularized Low-Rank Factorization for Matrix Robust PCA Qin, Zhenzhi Zhang, Liping Optimization and Control Robust Principal Component Analysis (RPCA) and its associated non-convex relaxation methods constitute a significant component of matrix completion problems, wherein matrix factorization strategies effectively reduce dimensionality and enhance computational speed. However, some non-convex factorization forms lack theoretical guarantees. This paper proposes a novel strategy in non-convex quasi-norm representation, introducing a method to obtain weighted matrix quasi-norm factorization forms. Especially, explicit bilinear factor matrix factorization formulations for the weighted logarithmic norm and weighted Schatten-$q$ quasi norms with $q=1, 1/2, 2/3$ are provided, along with the establishment of corresponding matrix completion models. An Alternating Direction Method of Multipliers (ADMM) framework algorithm is employed for solving, and convergence results of the algorithm are presented. |
| title | Reweighted Quasi Norm Regularized Low-Rank Factorization for Matrix Robust PCA |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2403.18400 |