.png){kind=icon}
.png){kind=icon}
Return
A generalized tri-factorization method for accurate matrix completion
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-024-02289-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To improve the speeds of the traditional nuclear norm minimization methods, a fast tri-factorization method (FTF) was recently proposed for matrix completion, and it received widespread attention in the fields of machine learning, image processing and signal processing. However, its low convergence accuracy became increasingly obvious, limiting its further application. To enhance the accuracy of FTF, a generalized tri-factorization method (GTF) is proposed in this paper. In GTF, the nuclear norm minimization model of FTF is improved to a novel L-1,L-p(0 < p < 2) norm minimization model that can be optimized very efficiently by using QR decomposition. Since the L-1,L-p norm is a tighter relaxation of the rank function than the nuclear norm, the GTF method is much more accurate than the traditional methods. The experimental results demonstrate that GTF is more accurate and faster than the state-of-the-art methods.
Keywords:
Matrix completion
Fast tri-factorization
L-1,L-1
QR decomposition
Journal
IF:
2.7
Papers:
3.1K
Citations:
5.6K