Two weighted Schatten-$p tensor factorization models are proposed under the tensor-tensor product (t-product) framework to address limitations of low-rank tensor factorization and demonstrate competitive reconstruction quality and robustness under various degradation conditions.
Abstract
Low-rank tensor factorization provides a flexible framework for completing multidimensional data from incomplete and corrupted observations. However, unweighted spectral regularizers impose a common shrinkage profile across singular components, which may excessively attenuate dominant low-rank components, and factorized variants either lack component-specific weighting or require costly singular value decompositions (SVDs). This paper proposes two weighted Schatten-$p$ tensor factorization models, termed \WSpTFI{} and \WSpTFII{}, under the tensor-tensor product (t-product) framework to address these limitations. \WSpTFI{} is motivated by a factorized weighted tensor Schatten-$p$ norm identity and permits flexible, possibly asymmetric factor exponents. \WSpTFII{} constructs a regularizer from transform-domain column-pair energies, yielding SVD-free main factor updates and a column-pruning mechanism for reducing redundant rank components. This paper further develops an iteratively reweighted alternating direction method of multipliers (ADMM)-type scheme for \WSpTFI{} and an iteratively reweighted least squares (IRLS)--block successive upper-bound minimization (BSUM) scheme for \WSpTFII{}. Theoretical analysis establishes the weighted factorization relation and provides a conditional limiting Karush--Kuhn--Tucker (KKT) characterization for \WSpTFI{}. For \WSpTFII{}, the actual damped quadratic block updates yield a quantitative sufficient-decrease mechanism for the fixed-$\delta$ smoothed factor objective. This implies asymptotic regularity, and every accumulation point of the fixed-dimensional tail is stationary. Experiments on synthetic tensor completion, color-image restoration, hyperspectral inpainting, and printed-circuit-board defect detection demonstrate competitive reconstruction quality and robustness under various degradation conditions.
A tailored nonlinear monotonic weighting function is developed, based on which a low-rankness-enhanced RTPCA framework is proposed, and the global optimality of the corresponding WTNN minimization problem is established.
Wei-Dong Zhang, Yan Song, De-Rui Ding et al.· IEEE Transactions on Neural...· 0 citations
Color images and video sequences can be modeled as 3-way tensors, which admit low tubal-rank approximations via convex surrogate minimization. This optimization problem is efficiently addressed by tensor singular value thresholding (t-SVT). To mitigate the computational burden of tensor singular value decomposition (t-...
An innovative MVC method utilizing orthogonal non-negative anchor tensor factorization, termed ATFMC, which employs a shared-nearest-neighbor density peaks clustering algorithm, which integrates cross-view features to select high-quality anchors and achieves superior clustering performance.
Jia-Yi Wang, Ming Yang, Jing-Yu Wang et al.· ACM Transactions on Intellig...· 0 citations
A novel semi-tensor product for third-order tensors under the t-product framework induced by arbitrary invertible linear transforms is introduced, yielding an accelerated multi-term randomized semi-tensor product SVD algorithm that achieves a balance between reconstruction accuracy and computational efficiency.
Xing-Chen Xiao, Feng Zhang, Wen-Jin Qin et al.· 0 citations
This work develops efficient algorithms based on the difference-of-convex function algorithm (DCA) and the alternating direction method of multipliers (ADMM) to enhance sparsity and identifiability of the learned factors in separable nonnegative matrix factorization.
The proposed SGLog-γ∗-MSC, a nonconvex multi-view subspace clustering framework that combines graph total variation, an ℓ2,log penalty, and a tensor γ∗ spectral penalty, supports combining robust error modeling with local and shared structural regularization while emphasizing the dataset dependence of individual compon...
Yi Yang, Bao-Jie Pan, Ming Yang· Mathematics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.