Compressing RNNs for IoT devices by 15-38x using Kronecker Products
Not on the map. Why?
Abstract (arXiv)
Recurrent Neural Networks (RNN) can be difficult to deploy on resource constrained devices due to their size.As a result, there is a need for compression techniques that can significantly compress RNNs without negatively impacting task accuracy. This paper introduces a method to compress RNNs for resource constrained environments using Kronecker product (KP). KPs can compress RNN layers by 15-38x with minimal accuracy loss. By quantizing the resulting models to 8-bits, we further push the compression factor to 50x. We show that KP can beat the task accuracy achieved by other state-of-the-art compression techniques across 5 benchmarks spanning 3 different applications, while simultaneously improving inference run-time. We show that the KP compression mechanism does introduce an accuracy loss, which can be mitigated by a proposed hybrid KP (HKP) approach. Our HKP algorithm provides fine-grained control over the compression ratio, enabling us to regain accuracy lost during compression by adding a small number of model parameters.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Jun 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 2; 2023: 1; 2024: 2; 2025: 1.
11 papers.
- 2021Kronecker Decomposition for GPT Compressioncited by 27
- 2021Convolutional Neural Network Compression through Generalized Kronecker Product Decompositioncited by 14
- 2024DiffuseKronA: A Parameter Efficient Fine-tuning Method for Personalized Diffusion Modelscited by 11
- 2021DISTREAL: Distributed Resource-Aware Learning in Heterogeneous Systemscited by 10
- 2022CoCoFL: Communication- and Computation-Aware Federated Learning via Partial NN Freezing and Quantizationcited by 7
- 2021Compacting Deep Neural Networks for Internet of Things: Methods and Applicationscited by 6
- 2021Doping: A technique for efficient compression of LSTM models using sparse structured additive matricescited by 5
- 2023Low Rank Optimization for Efficient Deep Learning: Making A Balance between Compact Architecture and Fast Trainingcited by 5
- 2024TQCompressor: improving tensor decomposition methods in neural networks via permutationscited by 5
- 2022SeKron: A Decomposition Method Supporting Many Factorization Structurescited by 0
- 2025Efficient Zeroth-Order Federated Finetuning of Language Models on Resource-Constrained Devicescited by 0
- 2025Efficient Zeroth-Order Federated Finetuning of Language Models on Resource-Constrained Devices14 Feb 2025
- 2024DiffuseKronA: A Parameter Efficient Fine-tuning Method for Personalized Diffusion Models27 Feb 2024
- 2024TQCompressor: improving tensor decomposition methods in neural networks via permutations29 Jan 2024
- 2023Low Rank Optimization for Efficient Deep Learning: Making A Balance between Compact Architecture and Fast Training22 Mar 2023
- 2022SeKron: A Decomposition Method Supporting Many Factorization Structures12 Oct 2022
- 2022CoCoFL: Communication- and Computation-Aware Federated Learning via Partial NN Freezing and Quantization10 Mar 2022
- 2021DISTREAL: Distributed Resource-Aware Learning in Heterogeneous Systems16 Dec 2021
- 2021Kronecker Decomposition for GPT Compression15 Oct 2021
- 2021Convolutional Neural Network Compression through Generalized Kronecker Product Decomposition29 Sep 2021
- 2021Compacting Deep Neural Networks for Internet of Things: Methods and Applications20 Mar 2021
- 2021Doping: A technique for efficient compression of LSTM models using sparse structured additive matrices14 Feb 2021