Accelerating Linear Recurrent Neural Networks for the Edge with Unstructured Sparsity
Not on the map. Why?
Abstract (arXiv)
Linear recurrent neural networks enable powerful long-range sequence modeling with constant memory usage and time-per-token during inference. These architectures hold promise for streaming applications at the edge, but deployment in resource-constrained environments requires hardware-aware optimizations to minimize latency and energy consumption. Unstructured sparsity offers a compelling solution, enabling substantial reductions in compute and memory requirements--when accelerated by compatible hardware platforms. In this paper, we conduct a scaling study to investigate the Pareto front of performance and efficiency across inference compute budgets. We find that highly sparse linear RNNs consistently achieve better efficiency-performance trade-offs than dense baselines, with 2x less compute and 36% less memory at iso-accuracy. Our models achieve state-of-the-art results on a real-time streaming task for audio denoising. By quantizing our sparse models to fixed-point arithmetic and deploying them on the Intel Loihi 2 neuromorphic chip for real-time processing, we translate model compression into tangible gains of 42x lower latency and 149x lower energy consumption compared to a dense model on an edge GPU. Our findings showcase the transformative potential of unstructured sparsity, paving the way for highly efficient recurrent neural networks in real-world, resource-constrained environments.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 52 of its 66 references that are in the map. First posted on arXiv 3 Feb 2025.
Builds on
52 of 66 references.
References · 52
- 2017Attention Is All You Needcited by 59,932
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,928
- 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,471
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
- 2022Simplified State Space Layers for Sequence Modelingcited by 776
38 more
- 2018Speech Commands: A Dataset for Limited-Vocabulary Speech Recognitioncited by 741
- 2020Long Range Arena: A Benchmark for Efficient Transformerscited by 696
- 2016Language Modeling with Gated Convolutional Networkscited by 688
- 2021Combining Recurrent, Convolutional, and Continuous-time Models with Linear State-Space Layerscited by 607
- 2020HiPPO: Recurrent Memory with Optimal Polynomial Projectionscited by 600
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2022On the Parameterization and Initialization of Diagonal State Space Modelscited by 418
- 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 413
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
- 2023HyenaDNA: Long-Range Genomic Sequence Modeling at Single Nucleotide Resolutioncited by 187
- 2020Integer Quantization for Deep Learning Inference: Principles and Empirical Evaluationcited by 183
- 2022It's Raw! Audio Generation with State-Space Modelscited by 171
- 2020The INTERSPEECH 2020 Deep Noise Suppression Challenge: Datasets, Subjective Testing Framework, and Challenge Resultscited by 128
- 2023Structured State Space Models for In-Context Reinforcement Learningcited by 109
- 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 91
- 2021Efficient Neuromorphic Signal Processing with Loihi 2cited by 90
- 2024Mixture of A Million Expertscited by 70
- 2024ReLU2 Wins: Discovering Efficient Activation Functions for Sparse LLMscited by 66
- 2023ICASSP 2023 Deep Noise Suppression Challengecited by 62
- 2024Mechanistic Design and Scaling of Hybrid Architecturescited by 57
- 2021Interspeech 2021 Deep Noise Suppression Challengecited by 43
- 2020Provable Benefits of Overparameterization in Model Compression: From Double Descent to Pruning Neural Networkscited by 40
- 2023Universality of Linear Recurrences Followed by Non-linear Projections: Finite-Width Guarantees and Benefits of Complex Eigenvaluescited by 35
- 2023Efficient Video and Audio processing with Loihi 2cited by 28
- 2020ICASSP 2021 Deep Noise Suppression Challengecited by 27
- 2020Are wider nets better given the same number of parameters?cited by 27
- 2023Ten Lessons We Have Learned in the New "Sparseland": A Short Handbook for Sparse Neural Network Researcherscited by 25
- 2024Mamba-PTQ: Outlier Channels in Recurrent Large Language Modelscited by 15
- 2016Sigma Delta Quantized Networkscited by 13
- 2023JaxPruner: A concise library for sparsity researchcited by 13
- 2023The Intel Neuromorphic DNS Challengecited by 9
- 2024Q-S5: Towards Quantized State Space Modelscited by 9
- 2021On the quantization of recurrent neural networkscited by 7
- 2024A Diagonal Structured State Space Model on Loihi 2 for Efficient Streaming Sequence Processingcited by 6
- 2024Approximate Top-k for Increased Parallelismcited by 5
50 most cited of 52 All 52 (JSON)
Built on by
Citing papers per year: 2026: 3.
3 papers.