The paper introduces a new semi‑tensor product for third‑order tensors that relaxes the dimensional constraints of the standard t‑product while preserving the closed‑form nature of T‑SVD. It builds a multi‑term semi‑tensor product singular value decomposition (MSTP‑SVD) that improves low‑rank approximation accuracy, and further accelerates it with randomized projection and power iteration to create the MRSTP‑SVD algorithm. Experiments on image and video compression and completion show that this method balances reconstruction accuracy and computational efficiency.
By Xingchen Xiao (School of Mathematics and Statistics, Southwest University, Chongqing, China), Feng Zhang (School of Mathematics and Statistics, Southwest University, Chongqing, China), Wenjin Qin (School of Mathematics and Statistics, Southwest University, Chongqing, China), Jianjun Wang (School of Mathematics and Statistics, Southwest University, Chongqing, China)
arXiv:1312. 0925v4 Announce Type: replace Abstract: Alternating Minimization is a widely used and empirically successful heuristic for matrix completion and related low-rank optimization problems.
By Moritz Hardt
arXiv:2602. 04795v3 Announce Type: replace Abstract: Nonnegative matrix factorization (NMF) is a popular data embedding technique.
By Olivier Vu Thanh, Nicolas Gillis
arXiv:2607. 27507v1 Announce Type: new Abstract: Matrix factorisation is a fundamental tool for exploiting low-dimensional structure in high-dimensional data, with applications such as data compression, denoising, structure discovery, interpretable representation learning, and dimensionality reduction.
By Tingting Mu
arXiv:2606. 31390v1 Announce Type: cross Abstract: Low-rank matrix optimization is often carried out via the Burer-Monteiro (BM) formulation, but choosing the factorization rank $r$ is delicate and can substantially slow optimization.
By Yudong Wei, Liang Zhang, Bingcong Li, Niao He
arXiv:2512. 17473v3 Announce Type: replace-cross Abstract: We present an algorithm based on the alternating direction method of multipliers (ADMM) for solving nonlinear matrix decompositions (NMD).
By Atharva Awari, Nicolas Gillis, Arnaud Vandaele
arXiv:2412. 07041v4 Announce Type: replace-cross Abstract: Recovering incomplete multidimensional tensor-structured data is a fundamental task in many real-world applications.
By Mengying Lei, Lijun Sun
arXiv:2606. 00542v1 Announce Type: new Abstract: Shampoo-style optimizers approximate gradient covariance matrices using Kronecker-factored structures.
By Bing Liu, Wenjie Zhou, Chengcheng Zhao
arXiv:2109. 11057v2 Announce Type: replace-cross Abstract: Weighted low-rank matrix approximation (WLRMA) generalizes classical low-rank approximation and matrix completion by allowing arbitrary elementwise weights.
By Elena Tuzhilina, Trevor Hastie
The paper introduces a new concept called positive scattering to enhance identifiability of nonnegative tensor decompositions. By combining this scattering term with existing dimension-based conditions, the authors derive two sufficient criteria that guarantee minimality, nonnegative rank, and uniqueness for subsets of components. The key result is a positive splitting inequality that links dimension constraints with support-induced geometric rigidity, and the authors show that the scattering term’s mode costs are discrete, enabling an exact activation characterization via graph connectivity. This criterion can certify sparse nonnegative tensor decompositions that elude traditional Kruskal and Lovitz–Petrov conditions, even after reshaping, and reduces to familiar matrix results in the two-dimensional case.
arXiv:2609. 11606v1 Announce Type: cross Abstract: Identifiability of tensor decompositions is often established through linear-algebraic conditions on the factor families.
By Haoming Wang, Ming Yuan
arXiv:2608.28799v1 Announce Type: cross
Abstract: Separable nonnegative matrix factorization (SNMF) has been widely used for low-rank representation and clustering of nonnegative data, owing to its a...
By Matthew McCarver, Jing Qin