Robust Rank-One Matrix Completion via Explicit Regularizer
- 2 June 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (10) , 19092-19105
Abstract
In robust matrix completion (MC), the Welsch function, also referred to as the maximum correntropy criterion with Gaussian kernel, has been widely employed. However, it suffers from the drawback of down-weighing normal data. This work is the first to uncover the explicit regularizer (ER) for the Welsch function based on the multiplicative form of half-quadratic (HQ) minimization. Leveraging this discovery, we develop a new function called t-Welsch, also with ER, which provides unity weight to normal data and exhibits stronger robustness against large-magnitude outliers compared to Huber’s weight. We apply the t-Welsch to rank-one matching pursuit, enabling accurate and robust low-rank matrix recovery without the need of rank information and singular value decomposition (SVD). The resultant MC algorithm is realized via block coordinate descent (BCD), whose analyses of convergence and computational complexity are produced. Experiments are conducted using synthetic random data, as well as real-world images with salt-and-pepper noise and multiple-input multiple-output (MIMO) radar signals in the presence of Gaussian mixture disturbances. In all three scenarios, the proposed algorithm outperforms the state-of-the-art robust MC methods in terms of recovery accuracy. The code is available at https://github.com/ShuDun23/t-Welsch-and-RAR1MC.Keywords
This publication has 55 references indexed in Scilit:
- Fast and robust rank-one matrix completion via maximum correntropy criterion and half-quadratic optimizationSignal Processing, 2022
- AirMAP: Scalable Spectrum Occupancy Recovery Using Local Low-Rank Matrixapproximation2018
- Robust Statistics for Signal Processing2018
- Efficient Matrix Sensing Using Rank-1 Gaussian Measurements2015
- Joint Schatten $p$ p -norm and $\ell _p$ ℓ p -norm robust matrix completion for missing value recoveryKnowledge and Information Systems, 2013
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithmMathematical Programming Computation, 2012
- Fixed point and Bregman iterative methods for matrix rank minimizationMathematical Programming, 2009
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3Optimization Methods and Software, 1999
- Deterministic edge-preserving regularization in computed imagingIEEE Transactions on Image Processing, 1997