Robust Low-Rank Matrix Recovery via Hybrid Ordinary-Welsch Function

被引:12
作者
Wang, Zhi-Yong [1 ]
So, Hing Cheung [1 ]
Zoubir, Abdelhak M. [2 ]
机构
[1] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Peoples R China
[2] Tech Univ Darmstadt, Signal Proc Grp, D-64283 Darmstadt, Germany
关键词
Low-rank matrix recovery; matrix factorization; sparsity; Welsch function; robust matrix completion; robust principal component analysis; VARIABLE SELECTION; COMPLETION; CORRENTROPY; NORM; FACTORIZATION; OPTIMIZATION; MINIMIZATION; ALGORITHM;
D O I
10.1109/TSP.2023.3290353
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
As a widely-used tool to resist outliers, the correntropy criterion or Welsch function has recently been exploited for robust matrix recovery. However, it down-weighs all observations including uncontaminated data. On the other hand, its implicit regularizer (IR) cannot achieve sparseness, which is a desirable property in many practical scenarios. To address these two issues, we devise a novel M-estimator called hybrid ordinary-Welsch (HOW) function, which only down-weighs the outlier-contaminated data, and the IR generated by the HOW can attain sparseness. To verify the effectiveness of the HOW function, we apply it to robust matrix completion and principal component analysis. An efficient algorithm is developed and we prove that any generated limit point is a critical point. Finally, extensive experimental results based on synthetic and real-world data demonstrate that the proposed approach outperforms the state-of-the-art methods in terms of recovery accuracy and runtime.
引用
收藏
页码:2548 / 2563
页数:16
相关论文
共 52 条
[1]  
[Anonymous], 2009, C NEUR INF PROC SYST
[2]  
[Anonymous], 2009, Convex optimization
[3]   Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality [J].
Attouch, Hedy ;
Bolte, Jerome ;
Redont, Patrick ;
Soubeyran, Antoine .
MATHEMATICS OF OPERATIONS RESEARCH, 2010, 35 (02) :438-457
[4]  
Bartle R. G., 2011, Introduction to Real Analysis
[5]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[6]   Robust Principal Component Analysis? [J].
Candes, Emmanuel J. ;
Li, Xiaodong ;
Ma, Yi ;
Wright, John .
JOURNAL OF THE ACM, 2011, 58 (03)
[7]   Exact Matrix Completion via Convex Optimization [J].
Candes, Emmanuel J. ;
Recht, Benjamin .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2009, 9 (06) :717-772
[8]   Weighted Low-Rank Tensor Recovery for Hyperspectral Image Restoration [J].
Chang, Yi ;
Yan, Luxin ;
Zhao, Xi-Le ;
Fang, Houzhang ;
Zhang, Zhijun ;
Zhong, Sheng .
IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (11) :4558-4572
[9]   Nonconvex Splitting for Regularized Low-Rank plus Sparse Decomposition [J].
Chartrand, Rick .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (11) :5810-5819
[10]   Variable selection via nonconcave penalized likelihood and its oracle properties [J].
Fan, JQ ;
Li, RZ .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2001, 96 (456) :1348-1360