Skip to content

Unified quadratic regularization for structured CP decomposition

Aug 2026 · Statistics and computing · Vol 36 · 0 citations · 32 references

TL;DR

A structure-regularized CP (SR-CP) framework that uses a unified quadratic penalty to encode diverse structural priors through positive semidefinite matrices and a soft orthogonality-promoting penalty is further introduced to enhance component distinctiveness and numerical stability.

View source

Similar papers

#machine learning Preprint Aug 2026

Separable Nonnegative Matrix Factorization Using Powered Ratio-of-Norms Regularization

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.

Matthew McCarver, Jing Qin · 0 citations
Open access Aug 2026

STOD: Sparse Tensor Train Optimization via Orthogonal Decomposition for High-Dimensional Learning

This paper proposes a novel Tensor Train (TT)-based tensor-on-tensor regression optimization framework for variable selection based on mode-1 hyperslice sparsity, and designs an alternating iterative algorithm equipped with a preconditioned metric to efficiently solve the proposed model.

Xiao-Yu Li, Zi-Yan Luo · 0 citations
Open access Sep 2026

Sparse-Gradient-Regularized Multi-View Clustering with Joint ℓ2,log Sparsity and a Tensor γ* Rank Surrogate

Multi-view clustering seeks a consensus partition from heterogeneous feature views while retaining view-specific information. We propose SGLog-γ∗-MSC, a nonconvex multi-view subspace clustering framework that combines graph total variation, an ℓ2,log penalty, and a tensor γ∗ spectral penalty. These terms promote locall...

Yi Yang, Bao-Jie Pan, Ming Yang · 0 citations
Preprint Sep 2026

Spectral-Residual Continuous Greedy for Tensor Sampling

Sampling a multidomain tensor from limited measurements is fundamental in structured linear inverse problems. Kronecker-structured sampling avoids the full high-dimensional sensing matrix, but design remains difficult: sequential discrete methods can commit the cross-mode budget too early, whereas standard continuous g...

Hao Li, Jie Xu, Zheng Xie · 0 citations
Preprint Sep 2026

Robust low-rank tensor completion via factorized weighted tensor schatten-p norm minimization

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 factorize...

Bing-Hao Wang, Feng Zhang, Wen-Dong Wang et al. · 0 citations
Preprint Aug 2026

Spatial-sign-based multilinear principal component analysis for tensor data

Multilinear principal component analysis (MPCA) reduces the dimension of tensor-valued data while preserving their mode-specific structure, but its quadratic scatter criterion can be unstable under heavy-tailed distributions and contamination. We propose spatial-sign-based multilinear principal component analysis (SMPC...

Dong-Xu Yang, Wanfeng Liang, Le Zhou et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.