mlsanityData to 7 Oct 2026

Algorithm and Hardware Co-Design of Energy-Efficient LSTM Networks for Video Recognition with Hierarchical Tucker Tensor Decomposition

arXiv 2212.02046 ↗First posted 5 Dec 2022cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Long short-term memory (LSTM) is a type of powerful deep neural network that has been widely used in many sequence analysis and modeling applications. However, the large model size problem of LSTM networks make their practical deployment still very challenging, especially for the video recognition tasks that require high-dimensional input data. Aiming to overcome this limitation and fully unlock the potentials of LSTM models, in this paper we propose to perform algorithm and hardware co-design towards high-performance energy-efficient LSTM networks. At algorithm level, we propose to develop fully decomposed hierarchical Tucker (FDHT) structure-based LSTM, namely FDHT-LSTM, which enjoys ultra-low model complexity while still achieving high accuracy. In order to fully reap such attractive algorithmic benefit, we further develop the corresponding customized hardware architecture to support the efficient execution of the proposed FDHT-LSTM model. With the delicate design of memory access scheme, the complicated matrix transformation can be efficiently supported by the underlying hardware without any access conflict in an on-the-fly way. Our evaluation results show that both the proposed ultra-compact FDHT-LSTM models and the corresponding hardware accelerator achieve very high performance. Compared with the state-of-the-art compressed LSTM models, FDHT-LSTM enjoys both order-of-magnitude reduction in model size and significant accuracy improvement across different video recognition datasets. Meanwhile, compared with the state-of-the-art tensor decomposed model-oriented hardware TIE, our proposed FDHT-LSTM architecture achieves better performance in throughput, area efficiency and energy efficiency, respectively on LSTM-Youtube workload. For LSTM-UCF workload, our proposed design also outperforms TIE with higher throughput, higher energy efficiency and comparable area efficiency.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 26 references that are in the map. First posted on arXiv 5 Dec 2022.

Builds on

10 of 26 references.

References · 10

  1. 2014Long-term Recurrent Convolutional Networks for Visual Recognition and Descriptioncited by 483
  2. 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 291
  3. 2017SCNN: An Accelerator for Compressed-sparse Convolutional Neural Networkscited by 132
  4. 2017Tensor-Train Recurrent Neural Networks for Video Classificationcited by 59
  5. 2016ESE: Efficient Speech Recognition Engine with Sparse LSTM on FPGAcited by 50
  6. 2017NullHop: A Flexible Convolutional Neural Network Accelerator Based on Sparse Representations of Feature Mapscited by 39
  7. 2018Compressing Recurrent Neural Networks with Tensor Ring for Action Recognitioncited by 34
  8. 2017Learning Compact Recurrent Neural Networks with Block-Term Tensor Decompositioncited by 33
  9. 2018C-LSTM: Enabling Efficient LSTM using Structured Compression Techniques on FPGAscited by 21
  10. 2021Towards Extremely Compact RNNs for Video Recognition with Fully Decomposed Hierarchical Tucker Structurecited by 8

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.