Tensor Decomposition Structure Search Framework from an Interaction Perspective
Not on the map. Why?
Abstract (arXiv)
Recently, tensor decompositions have attracted increasing attention. Fundamentally, different interactions among factors induce distinct tensor decomposition structures (i.e., tensor decomposition). Identifying an appropriate interaction-induced tensor decomposition structure for given data is a fundamental yet challenging problem in tensor modeling, and remains largely under-explored. Existing tensor decomposition structure search methods are typically restricted to a predefined interaction family, such as tensor contraction. To address this problem, we suggest a tensor decomposition structure search framework (I-TSS) from an interaction perspective that can identify either a single structure beyond a predefined interaction family or a mixture of structures involving heterogeneous interaction families. Specifically, we first systematically review existing tensor decomposition structures from an interaction perspective and construct a heterogeneous interaction-induced candidate structure set. Based on it, we propose a unified energy-based rank estimation scheme for heterogeneous interaction-induced candidate structure set. We then introduce the top-k gating mechanism with learnable gating scores to dynamically select a suitable single-candidate structure or combine suitable multi-candidate structures, thereby identifying the tensor decomposition structure in a data-adaptive manner. Theoretically, we derive an approximation error bound for I-TSS, thereby establishing its approximation capability. Extensive experiments on synthetic and real-world datasets demonstrate that I-TSS consistently outperforms state-of-the-art tensor decomposition methods.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 52 references that are in the map. First posted on arXiv 3 Mar 2026.
Builds on
17 of 52 references.
References · 17
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Tensor Decomposition for Signal Processing and Machine Learningcited by 223
- 2016Tensor Ring Decompositioncited by 125
- 2014Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determinationcited by 65
- 2016Efficient tensor completion for color image and video recovery: Low-rank tensor traincited by 61
- 2017Efficient Low Rank Tensor Ring Completioncited by 45
- 2018Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completioncited by 42
- 2020Heuristic Rank Selection with Progressively Searching Tensor Ring Networkcited by 28
- 2023Multiscale Tensor Decomposition and Rendering Equation Encoding for View Synthesiscited by 18
- 2022Permutation Search of Tensor Network Structures via Local Samplingcited by 13
- 2023Alternating Local Enumeration (TnALE): Solving Tensor Network Structure Search with Fewer Evaluationscited by 12
- 2023SVDinsTN: A Tensor Network Paradigm for Efficient Structure Search from Regularized Modeling Perspectivecited by 9
5 more
- 2021Effective Tensor Completion via Element-wise Weighted Low-rank Tensor Train with Overlapping Ket Augmentationcited by 8
- 2023Approximately Optimal Core Shapes for Tensor Decompositionscited by 8
- 2020Adaptive Learning of Tensor Network Structurescited by 6
- 2023Adaptively Topological Tensor Network for Multi-view Subspace Clusteringcited by 4
- 2023To Fold or Not to Fold: Graph Regularized Tensor Train for Visual Data Completioncited by 3
Built on by
Not cited yet.