# Tensor Decomposition Structure Search Framework from an Interaction Perspective

arXiv: https://arxiv.org/abs/2603.02720 · HTML: https://mlsanity.com/paper/2603.02720/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 17 of its 52 references that are in the map.
- First posted on arXiv 3 Mar 2026.

## Builds on (most cited first, 17 of 17)

- [Adam: A Method for Stochastic Optimization](https://mlsanity.com/paper/1412.6980/) (2014)
- [Tensor Decomposition for Signal Processing and Machine Learning](https://mlsanity.com/paper/1607.01668/) (2016)
- [Tensor Ring Decomposition](https://mlsanity.com/paper/1606.05535/) (2016)
- [Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination](https://mlsanity.com/paper/1401.6497/) (2014)
- [Efficient tensor completion for color image and video recovery: Low-rank tensor train](https://mlsanity.com/paper/1606.01500/) (2016)
- [Efficient Low Rank Tensor Ring Completion](https://mlsanity.com/paper/1707.08184/) (2017)
- [Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completion](https://mlsanity.com/paper/1809.02288/) (2018)
- [Heuristic Rank Selection with Progressively Searching Tensor Ring Network](https://mlsanity.com/paper/2009.10580/) (2020)
- [Multiscale Tensor Decomposition and Rendering Equation Encoding for View Synthesis](https://mlsanity.com/paper/2303.03808/) (2023)
- [Permutation Search of Tensor Network Structures via Local Sampling](https://mlsanity.com/paper/2206.06597/) (2022)
- [Alternating Local Enumeration (TnALE): Solving Tensor Network Structure Search with Fewer Evaluations](https://mlsanity.com/paper/2304.12875/) (2023)
- [SVDinsTN: A Tensor Network Paradigm for Efficient Structure Search from Regularized Modeling Perspective](https://mlsanity.com/paper/2305.14912/) (2023)
- [Effective Tensor Completion via Element-wise Weighted Low-rank Tensor Train with Overlapping Ket Augmentation](https://mlsanity.com/paper/2109.05736/) (2021)
- [Approximately Optimal Core Shapes for Tensor Decompositions](https://mlsanity.com/paper/2302.03886/) (2023)
- [Adaptive Learning of Tensor Network Structures](https://mlsanity.com/paper/2008.05437/) (2020)
- [Adaptively Topological Tensor Network for Multi-view Subspace Clustering](https://mlsanity.com/paper/2305.00716/) (2023)
- [To Fold or Not to Fold: Graph Regularized Tensor Train for Visual Data Completion](https://mlsanity.com/paper/2306.11123/) (2023)

## 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.