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

Wenchao Xie, Qingsong WangarXiv 2026 · arXiv

TL;DR

This paper introduces Dual-Core Tensor Wheel (DCTW) decomposition, a new tensor network topology that splits a high-order central core into two lower-order ones to eliminate computational bottlenecks. By pairing this structure with a novel structure-cached acceleration strategy, the authors achieve massive speedups (up to 127x) and significantly lower memory usage in tensor recovery tasks like video completion and denoising compared to traditional methods.

What Problem Does This Paper Address?

High-dimensional data—like color videos or remote sensing images—contains complex correlations across multiple dimensions (modes). Researchers use Tensor Network (TN) decompositions to model these correlations efficiently. A recent promising model is the Tensor Wheel (TW), which uses an outer ring of factors to capture local dependencies and a single high-order central core to capture global, nonlocal interactions.

However, the TW model has a major flaw: its central core is an $N$th-order tensor. Updating this core during optimization requires constructing massive intermediate matrices that scale poorly with the number of dimensions and the "rank" (the complexity) of the model. This creates a "computational and storage bottleneck," forcing researchers to choose between a model that is too simple to be accurate or one that is too heavy to actually run.

Methods

The authors propose two major innovations to break this bottleneck:

  1. Dual-Core Topology: Instead of one massive central core, DCTW factorizes it into two lower-order cores ($C_1$ and $C_2$) connected by a shared latent bond ($Q$). Each core is responsible for a different group of outer-ring factors. This reduces the order of the tensors involved in the update steps, making the sub-problems much more tractable.
Figure 1: The Dual-Core Tensor Wheel.
  1. Structure-Cached Acceleration: In standard optimization (like Proximal Alternating Minimization), you update one factor at a time while keeping others fixed. This usually involves redundant calculations. The authors developed a strategy to cache intermediate "environment tensors"—essentially pre-calculating the parts of the network that don't change between specific block updates.
The structure-cached strategy reuses intermediate contractions to avoid redundant large-scale matrix multiplications.

Datasets

The model was evaluated on several real-world video datasets for two primary tasks:

  • Tensor Completion: Filling in missing pixels (at sampling rates of 5%, 10%, and 20%) using videos like Akiyo, Mother, Grandma, Cars, and Ukulele.
  • Robust Denoising: Removing "salt-and-pepper" noise from videos like News, Foreman, Suzie, and Silent.

These datasets range from standard small-scale benchmarks ($144 \times 176$) to larger-scale videos ($500 \times 500$).

Key Insights and Ideas

  • Order Reduction is Key: By splitting the core, the authors move from a problem that scales exponentially with the total number of modes to one that scales with the size of the sub-groups. This allows for higher "radial ranks," leading to better data representation.
  • Redundancy is the Enemy of Speed: The "aha moment" in their acceleration strategy is realizing that when you update factors in the left half of the wheel, the entire right half remains a constant "environment." By caching that right-half contraction, you skip thousands of redundant operations.
  • Memory Stability: Traditional "explicit" updates cause memory usage to spike dangerously as ranks increase. The caching strategy keeps peak memory usage relatively flat, enabling the processing of much larger tensors on standard hardware.

Key Results

The DCTW model, especially when using the cached acceleration, showed dominant performance across the board:

  • Reconstruction Quality: DCTW consistently outperformed other state-of-the-art methods (like TT, TR, and FCTN) in terms of Peak Signal-to-Noise Ratio (PSNR), often by 0.6 to 2.1 dB.
  • Massive Speedups: In experiments on the Ukulele dataset with a rank of 7, the structure-cached update was 127.7x faster than the standard explicit update and 2.7x faster than the implicit update.
  • Memory Efficiency: For large tensors, the caching strategy reduced additional peak memory consumption by over 95% compared to explicit methods.
  • Visual Fidelity: Qualitatively, DCTW preserved clearer facial details and textures in video frames where other methods left visible distortions or blurriness.

Limitations and Future Work

While DCTW is highly efficient, the authors note a few areas for improvement:

  • Rank Selection: Currently, the ranks (the dimensions of the bonds between factors) are set manually or through a simple progressive search. Future work will look into automatic rank selection to make the model easier to use.
  • Fixed Topology: The current split of the dual cores is a simple half-half partition. Exploring more flexible or adaptive network structures might yield even better results for specific types of data.
  • Extreme Noise: While it handles standard denoising well, the authors aim to improve robustness under extremely high noise levels where the signal is almost entirely lost.

Summary updated

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.
BibTeX
@misc{xie2026dual,
  author = {Wenchao Xie and Qingsong Wang},
  title = {{Dual-Core Tensor Wheel Decomposition with Structure-Cached Acceleration for Tensor Recovery}},
  year = {2026},
  eprint = {2611.13938},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.13938},
}
Figure