Activity Sparsity Complements Weight Sparsity for Efficient RNN Inference
Not on the map. Why?
Abstract (arXiv)
Artificial neural networks open up unprecedented machine learning capabilities at the cost of ever growing computational requirements. Sparsifying the parameters, often achieved through weight pruning, has been identified as a powerful technique to compress the number of model parameters and reduce the computational operations of neural networks. Yet, sparse activations, while omnipresent in both biological neural networks and deep learning systems, have not been fully utilized as a compression technique in deep learning. Moreover, the interaction between sparse activations and weight pruning is not fully understood. In this work, we demonstrate that activity sparsity can compose multiplicatively with parameter sparsity in a recurrent neural network model based on the GRU that is designed to be activity sparse. We achieve up to 20× reduction of computation while maintaining perplexities below 60 on the Penn Treebank language modeling task. This magnitude of reduction has not been achieved previously with solely sparsely connected LSTMs, and the language modeling performance of our model has not been achieved previously with any sparsely activated recurrent neural networks or spiking neural networks. Neuromorphic computing devices are especially good at taking advantage of the dynamic activity sparsity, and our results provide strong evidence that making deep learning models activity sparse and porting them to neuromorphic devices can be a viable strategy that does not compromise on task performance. Our results also drive further convergence of methods from deep learning and neuromorphic computing for efficient machine learning.
Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Builds on 37 of its 55 references that are in the map. First posted on arXiv 13 Nov 2023.
Builds on
37 of 55 references.
References · 37
- 2017Attention Is All You Needcited by 60,106
- 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,024
- 2016Pointer Sentinel Mixture Modelscited by 3,047
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,440
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,257
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,017
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 602
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 525
- 2022Hungry Hungry Hippos: Towards Language Modeling with State Space Modelscited by 495
- 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 400
- 2018Deep Learning in Spiking Neural Networkscited by 260
- 2021Training Spiking Neural Networks Using Lessons From Deep Learningcited by 256
25 more
- 2017Regularizing and Optimizing LSTM Language Modelscited by 205
- 2020Integer Quantization for Deep Learning Inference: Principles and Empirical Evaluationcited by 187
- 2018Long short-term memory and learning-to-learn in networks of spiking neuronscited by 180
- 2021Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Bettercited by 154
- 2017Breaking the Softmax Bottleneck: A High-Rank RNN Language Modelcited by 148
- 2018Independently Recurrent Neural Network (IndRNN): Building A Longer and Deeper RNNcited by 143
- 2017Deep Rewiring: Training very sparse deep networkscited by 137
- 2017SCNN: An Accelerator for Compressed-sparse Convolutional Neural Networkscited by 135
- 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 121
- 2017On the State of the Art of Evaluation in Neural Language Modelscited by 104
- 2023SpikeGPT: Generative Pre-trained Language Model with Spiking Neural Networkscited by 84
- 2016Improving Neural Language Models with a Continuous Cachecited by 81
- 2017Exploring Sparsity in Recurrent Neural Networkscited by 75
- 2016ESE: Efficient Speech Recognition Engine with Sparse LSTM on FPGAcited by 52
- 2017STDP Based Pruning of Connections and Weight Quantization in Spiking Neural Networks for Energy Efficient Recognitioncited by 45
- 2021Pruning of Deep Spiking Neural Networks through Gradient Rewiringcited by 42
- 2022Efficient recurrent architectures through activity sparsity and sparse back-propagation through timecited by 26
- 2022Exploring Lottery Ticket Hypothesis in Spiking Neural Networkscited by 26
- 2018Grow and Prune Compact, Fast, and Accurate LSTMscited by 20
- 2021Spartus: A 9.4 TOp/s FPGA-based LSTM Accelerator Exploiting Spatio-Temporal Sparsitycited by 20
- 2016Delta Networks for Optimized Recurrent Network Computationcited by 18
- 2021Two Sparsities Are Better Than One: Unlocking the Performance Benefits of Sparse-Sparse Networkscited by 15
- 2023Workload-Balanced Pruning for Sparse Spiking Neural Networkscited by 15
- 2015Improving performance of recurrent neural network with relu nonlinearitycited by 12
- 2020Connection Pruning for Deep Spiking Neural Networks with On-Chip Learningcited by 8
Built on by
Citing papers per year: 2023: 1; 2024: 1.
2 papers.