.png){kind=icon}
.png){kind=icon}
Return
Tensor LISTA: Differentiable sparse representation learning for multi-dimensional tensor
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2021.08.024.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The existing algorithms for sparse coding, which aim to seek sparse representation for given multi-dimensional signal, suffer from two main defects. Vector-based algorithms, e.g., LISTA, couldn't handle the signal in tensor form well. On the other hand, tensor-based algorithms are not learnable yet, leading to high computational cost. Towards this dilemma, we propose Tensor LISTA (TLISTA) bA to a multi-dimensional tensor-based model. Benefiting from tensor representation and differentiable programming, TLISTA achieves rapid inference speed and acquires more valuable representation for the data primarily organized in tensor form. Theoretical analysis about the convergence of TLISTA is then introduced, show -ing that TLISTA can attain the linear convergence rate. Extensive experiments confirm the effectiveness and efficiency of TLISTA for tensor sparse coding. (c) 2021 Elsevier B.V. All rights reserved.
Keywords:
Sparse coding
Differentiable programming
Tensor representation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
No organization information available