mlsanityData to 14 Oct 2026

Grow and Prune Compact, Fast, and Accurate LSTMs

arXiv 1805.11797 ↗First posted 30 May 2018cs.LG cs.CV cs.NEcited by 20

Not on the map. Why?

Abstract (arXiv)

Long short-term memory (LSTM) has been widely used for sequential data modeling. Researchers have increased LSTM depth by stacking LSTM cells to improve performance. This incurs model redundancy, increases run-time delay, and makes the LSTMs more prone to overfitting. To address these problems, we propose a hidden-layer LSTM (H-LSTM) that adds hidden layers to LSTM's original one level non-linear control gates. H-LSTM increases accuracy while employing fewer external stacked layers, thus reducing the number of parameters and run-time latency significantly. We employ grow-and-prune (GP) training to iteratively adjust the hidden layers through gradient-based growth and magnitude-based pruning of connections. This learns both the weights and the compact architecture of H-LSTM control gates. We have GP-trained H-LSTMs for image captioning and speech recognition applications. For the NeuralTalk architecture on the MSCOCO dataset, our three models reduce the number of parameters by 38.7x [floating-point operations (FLOPs) by 45.5x], run-time latency by 4.5x, and improve the CIDEr score by 2.6. For the DeepSpeech2 architecture on the AN4 dataset, our two models reduce the number of parameters by 19.4x (FLOPs by 23.5x), run-time latency by 15.7%, and the word error rate from 12.9% to 8.7%. Thus, GP-trained H-LSTMs can be seen to be compact, fast, and accurate.

Key facts. Cited by 20 papers in the map (data through 14 Oct 2026). First posted on arXiv 30 May 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 8; 2022: 5; 2023: 1; 2024: 2; 2025: 3; 2026: 1.

20 papers.

Sort:

By area:

  1. 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 110
  2. 2022A Comprehensive Survey on Model Quantization for Deep Neural Networks in Image Classificationcited by 65
  3. 2022Structural Pruning via Latency-Saliency Knapsackcited by 41
  4. 2024LSK3DNet: Towards Effective and Efficient 3D Perception with Large Sparse Kernelscited by 15
  5. 2021FLASH: Fast Neural Architecture Search with Hardware Optimizationcited by 11
  6. 2021Automatic Mapping of the Best-Suited DNN Pruning Schemes for Real-Time Mobile Accelerationcited by 7
  7. 2022ACORT: A Compact Object Relation Transformer for Parameter Efficient Image Captioningcited by 6
  8. 2021Efficient Visual Recognition with Deep Neural Networks: A Survey on Recent Advances and New Directionscited by 2
  9. 2021End-to-End Supermask Pruning: Learning to Prune Image Captioning Modelscited by 2
  10. 2023Activity Sparsity Complements Weight Sparsity for Efficient RNN Inferencecited by 2
  11. 2021Differentiable Neural Architecture Search with Morphism-based Transformable Backbone Architecturescited by 1
  12. 2024Weight Sparsity Complements Activity Sparsity in Neuromorphic Language Modelscited by 1
8 more
  1. 2021Structured in Space, Randomized in Time: Leveraging Dropout in RNNs for Efficient Trainingcited by 0
  2. 2021Compact Multi-level Sparse Neural Networks with Input Independent Dynamic Reroutingcited by 0
  3. 2022Mixture-of-Rookies: Saving DNN Computations by Predicting ReLU Outputscited by 0
  4. 2022Embedding Compression for Text Classification Using Dictionary Screeningcited by 0
  5. 2025Decoding for Punctured Convolutional and Turbo Codes: A Deep Learning Solution for Protocols Compliancecited by 0
  6. 2025Downsized and Compromised?: Assessing the Faithfulness of Model Compressioncited by 0
  7. 2025A Vision Toward Energy-Efficient Domain-Specific Artificial Intelligence Models and Agentscited by 0
  8. 2026Across the Loss Landscape with Progressive Growthcited by 0