Effective Quantization Approaches for Recurrent Neural Networks
Not on the map. Why?
Abstract (arXiv)
Deep learning, and in particular Recurrent Neural Networks (RNN) have shown superior accuracy in a large variety of tasks including machine translation, language understanding, and movie frame generation. However, these deep learning approaches are very expensive in terms of computation. In most cases, Graphic Processing Units (GPUs) are in used for large scale implementations. Meanwhile, energy efficient RNN approaches are proposed for deploying solutions on special purpose hardware including Field Programming Gate Arrays (FPGAs) and mobile platforms. In this paper, we propose an effective quantization approach for Recurrent Neural Networks (RNN) techniques including Long Short Term Memory (LSTM), Gated Recurrent Units (GRU), and Convolutional Long Short Term Memory (ConvLSTM). We have implemented different quantization methods including Binary Connect {-1, 1}, Ternary Connect {-1, 0, 1}, and Quaternary Connect {-1, -0.5, 0.5, 1}. These proposed approaches are evaluated on different datasets for sentiment analysis on IMDB and video frame predictions on the moving MNIST dataset. The experimental results are compared against the full precision versions of the LSTM, GRU, and ConvLSTM. They show promising results for both sentiment analysis and video frame prediction.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Feb 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 2; 2025: 3; 2026: 1.
10 papers.
- 2023NASH: A Simple Unified Framework of Structured Pruning for Accelerating Encoder-Decoder Language Modelscited by 7
- 2025Histogram-Equalized Quantization for logic-gated Residual Neural Networkscited by 4
- 2021Spectral Pruning for Recurrent Neural Networkscited by 3
- 2022Vau da muntanialas: Energy-efficient multi-die scalable acceleration of RNN inferencecited by 2
- 2026Quantizing Recursive Reasoning Modelscited by 2
- 2024Quantized Approximately Orthogonal Recurrent Neural Networkscited by 1
- 2025BILLNET: A Binarized Conv3D-LSTM Network with Logic-gated residual architecture for hardware-efficient video inferencecited by 1
- 2022FullPack: Full Vector Utilization for Sub-Byte Quantized Inference on General Purpose CPUscited by 0
- 2024Towards a tailored mixed-precision sub-8-bit quantization scheme for Gated Recurrent Units using Genetic Algorithmscited by 0
- 2025HadamRNN: Binary and Sparse Ternary Orthogonal RNNscited by 0
- 2026Quantizing Recursive Reasoning Models25 Jun 2026
- 2025HadamRNN: Binary and Sparse Ternary Orthogonal RNNs28 Jan 2025
- 2025BILLNET: A Binarized Conv3D-LSTM Network with Logic-gated residual architecture for hardware-efficient video inference24 Jan 2025
- 2025Histogram-Equalized Quantization for logic-gated Residual Neural Networks8 Jan 2025
- 2024Towards a tailored mixed-precision sub-8-bit quantization scheme for Gated Recurrent Units using Genetic Algorithms19 Feb 2024
- 2024Quantized Approximately Orthogonal Recurrent Neural Networks5 Feb 2024
- 2023NASH: A Simple Unified Framework of Structured Pruning for Accelerating Encoder-Decoder Language Models16 Oct 2023
- 2022FullPack: Full Vector Utilization for Sub-Byte Quantized Inference on General Purpose CPUs13 Nov 2022
- 2022Vau da muntanialas: Energy-efficient multi-die scalable acceleration of RNN inference14 Feb 2022
- 2021Spectral Pruning for Recurrent Neural Networks23 May 2021