.png){kind=icon}
.png){kind=icon}
Return
Adaptive Rank Selection for Tensor Ring Decomposition
.png){kind=icon}
PRE
AI
DOI：10.1109/JSTSP.2021.3051503.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Optimal rank selection is an important issue in tensor decomposition problems, especially for Tensor Train (TT) and Tensor Ring (TR) (also known as Tensor Chain) decompositions. In this paper, a new rank selection method for TR decomposition has been proposed for automatically finding near-optimal TR ranks, which result in a lower storage cost, especially for tensors with inexact TT or TR structures. In many of the existing approaches, TR ranks are determined in advance or by using truncated Singular Value Decomposition (t-SVD). There are also other approaches for selecting TR ranks adaptively. In our approach, the TR ranks are not determined in advance, but are increased gradually in each iteration until the model achieves a desired approximation accuracy. For this purpose, in each iteration, the sensitivity of the approximation error to each of the core tensors is measured and the core tensors with the highest sensitivity measures are selected and their sizes are increased. Simulation results confirmed that the proposed approach reduces the storage cost considerably and allows us to find optimal model in TR format, while preserving the desired accuracy of the approximation.
Keywords:
Tensors
Signal processing algorithms
Matrix decomposition
Approximation algorithms
Sensitivity
Approximation error
Simulation
Tensor ring decomposition
rank selection
rank incremental
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.9K
Citations:
1.1W