Tensor Recovery Based on A Novel Non-convex Function Minimax Logarithmic Concave Penalty Function

Abstract

Non-convex relaxation methods have been widely used in tensor recovery problems, and compared with convex relaxation methods, can achieve better recovery results. In this paper, a new non-convex function, Minimax Logarithmic Concave Penalty (MLCP) function, is proposed, and some of its intrinsic properties are analyzed, among which it is interesting to find that the Logarithmic function is an upper bound of the MLCP function. The proposed function is generalized to tensor cases, yielding tensor MLCP and weighted tensor $L\gamma$-norm. Consider that its explicit solution cannot be obtained when applying it directly to the tensor recovery problem. Therefore, the corresponding equivalence theorems to solve such problem are given, namely, tensor equivalent MLCP theorem and equivalent weighted tensor $L\gamma$-norm theorem. In addition, we propose two EMLCP-based models for classic tensor recovery problems, namely low-rank tensor completion (LRTC) and tensor robust principal component analysis (TRPCA), and design proximal alternate linearization minimization (PALM) algorithms to solve them individually. Furthermore, based on the Kurdyka-Łojasiwicz property, it is proved that the solution sequence of the proposed algorithm has finite length and converges to the critical point globally. Finally, Extensive experiments show that proposed algorithm achieve good results, and it is confirmed that the MLCP function is indeed better than the Logarithmic function in the minimization problem, which is consistent with the analysis of theoretical properties.

arXiv commentarXiv admin note: substantial text overlap with arXiv:2201.12709, arXiv:2109.12257

References in corpus (8)

• Nearly unbiased variable selection under minimax concave penalty
• Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination
• Robust Low-rank Tensor Recovery: Models and Algorithms
• Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completion
• Total Variation Regularized Tensor RPCA for Background Subtraction from Compressive Measurements
• Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm
• Deep Plug-and-play Prior for Low-rank Tensor Completion
• Semiblind Hyperspectral Unmixing in the Presence of Spectral Library Mismatches

Cited by in corpus (1)

• LoRA-PT: Low-Rank Adapting UNETR for Hippocampus Segmentation Using Principal Tensor Singular Values and Vectors