cs.LGNov 10, 2026

Dual-Core Tensor Wheel Decomposition with Structure-Cached Acceleration for Tensor Recovery

Authors: Wenchao Xie, Qingsong Wang

Organizations: School of Mathematics and Computational Science, Xiangtan University, Xiangtan, 411105, China. · School of Mathematics and Computational Science, Xiangtan University, National Center for Applied Mathematics in Hunan, Xiangtan, 411105, China.

Abstract

Tensor wheel decomposition captures complex correlations in high-dimensional data through interactions between outer-ring factors and a high-order central core. However, updating these components requires the explicit construction and manipulation of large-scale matrices, which limits computational efficiency and incurs particularly high computational and memory costs for the central-core update. To address these limitations, we propose dual-core tensor wheel decomposition (DCTW), which factorizes the central core into two lower-order cores linked by a shared latent bond. Each core is coupled to a different group of outer-ring factors. We further propose a structure-cached acceleration strategy that avoids explicit large-scale matrix multi- plications and caches intermediate tensors generated during tensor network contractions for reuse across block updates. This reuse reduces redundant computation and avoids the explicit construction of large matrices. Complexity analysis and experiments show that the strategy based on structural caching accelerates optimization compared with explicit and implicit up- date schemes while limiting the increase in peak memory as the ranks grow. Experiments on color video completion and robust denoising show that DCTW matches or outperforms representative tensor network methods in reconstruction quality, computational efficiency, and scalability.

Figures & tables

Explore similar work

Mar 11, 2026

A New Tensor Network: Tubal Tensor Train and Its Applications

We introduce the tubal tensor train (TTT) decomposition, a tensor-network model that combines the t-product algebra of the tensor singular value decomposition (T-SVD) with the low-order core structure of the tensor train (TT) format. For an order-(N+1)(N+1) tensor with a distinguished tube mode, the proposed representation consists of two third-order boundary cores and N−2N-2 fourth-order interior cores linked through the t-product. As a result, for bounded tubal ranks, the storage scales linearly with the number of modes, in contrast to direct high-order extensions of T-SVD. We present two computational strategies: a sequential fixed-rank construction, called TTT-SVD, and a Fourier-slice alternating scheme based on the alternating two-cores update (ATCU). We also state a TT-SVD-type error bound for TTT-SVD and illustrate the practical performance of the proposed model on image compression, video compression, tensor completion, and hyperspectral imaging.
Sep 13, 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 factorized variants either lack component-specific weighting or require costly singular value decompositions (SVDs). This paper proposes two weighted Schatten-pp 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-pp 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-δδ 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.
Jun 30, 2026

Online TT-ALS for Streaming Tensor Decomposition with Incremental Orthogonalization

Tensor Train (TT) decomposition is a powerful technique for analyzing high-dimensional data. Existing algorithms for computing TT decompositions can be categorized into two main types: conventional batch-based approaches and recursive online methods. In the context of streaming data, batch methods typically achieve higher reconstruction accuracy but often suffer from memory exhaustion, while online methods provide greater computational efficiency. In this work, we introduce Online TT-ALS (Alternating Least Squares), an algorithm that sequentially enforces orthogonality constraints. This approach allows for efficient and exact updates of the core tensor while maintaining high reconstruction accuracy. Theoretically, we prove that enforcing these orthogonal gauge constraints guarantees monotonic decrease of the local objective function and temporal smoothness. Computationally, our deterministic single-sweep update reduces the rank dependence from quadratic to linear, achieving an overall complexity of O(In−1r)\mathcal{O}(I^{n-1} r). Experimental results demonstrate that the proposed method outperforms existing online techniques not only in terms of mathematical approximation accuracy but also in human perception-based video quality metrics. Furthermore, compared to recent deep learning-based paradigms, our algebraic approach achieves speedups of several orders of magnitude. Consequently, our method exhibits high computational efficiency and is suitable for low-latency real-time processing applications.