Accelerated Tensor Completion via Trace-Regularized Fully-Connected Tensor Network
Wenchao Xie, Qingsong Wang, Chengcheng Yan, Zheng Peng

TL;DR
This paper introduces an accelerated tensor completion method using trace regularization within the fully-connected tensor network framework, improving local detail recovery and computational efficiency.
Contribution
It proposes a novel trace-regularized FCTN model with an efficient algorithm and tensor reuse mechanism, enhancing tensor recovery and reducing runtime.
Findings
Outperforms existing tensor completion methods in accuracy.
Reduces algorithm runtime by 10-30% with tensor reuse.
Demonstrates superior local detail recovery in tensors.
Abstract
The fully-connected tensor network (FCTN) decomposition has gained prominence in the field of tensor completion owing to its powerful capacity to capture the low-rank characteristics of tensors. Nevertheless, the recovery of local details in the reconstructed tensor still leaves scope for enhancement. In this paper, we propose efficient tensor completion model that incorporates trace regularization within the FCTN decomposition framework. The trace regularization is constructed based on the mode- unfolding of the FCTN factors combined with periodically modified negative laplacian. The trace regularization promotes the smoothness of the FCTN factors through discrete second-order derivative penalties, thereby enhancing the continuity and local recovery performance of the reconstructed tensor. To solve the proposed model, we develop an efficient algorithm within the proximal alternating…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
