CoChat

Run-Time Efficient RNN Compression for Inference on Edge Devices

Open access
Thakker, Urmish, Beu, Jesse, Gope, Dibakar, Dasika, Ganesh, Mattina, Matthew · 2019 · 2019 2nd Workshop on Energy Efficient Machine Learning and Cognitive Computing for Embedded Applications (EMC2)
Cited by 24

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

Abstract

Recurrent neural networks can be large and compute-intensive, yet many applications that benefit from RNNs run on small devices with very limited compute and storage capabilities while still having run-time constraints. As a result, there is a need for compression techniques that can achieve significant compression without negatively impacting inference run-time and task accuracy. This paper explores a new compressed RNN cell implementation called Hybrid Matrix Decomposition (HMD) that achieves this dual objective. HMD creates dense matrices that results in output features where the upper sub-vector has "richer" features while the lower sub vector has "constrained" features". On the benchmarks evaluated in this paper, this results in faster inference runtime than pruning and better accuracy than matrix factorization for compression factors of 2-4x.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/emc249363.2019.00013

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 9 references

Research works printed but not linked: 14

  1. narang, 2017, Block-sparse recurrent neural networks, CoRR, abs 1711 2782
  2. sindhwani, 2015, Structured transforms for small-footprint deep learning, Advances in neural information processing systems, 28, 3088
  3. 10.1109/IJCNN.2017.7966420 · DOI · Paper page
  4. kuchaiev, 2017, CoRR, abs 1703 10722
  5. 10.1145/3123939.3124552 · DOI · Paper page
  6. hammerla, 2016, IJCA-2016
  7. zaremba, 2014, CoRR, abs 1409 2329
  8. 10.1007/978-3-319-69900-4_44 · DOI
  9. ding, 2018, Structured weight matrices-based hardware accelerators in deep neural networks: Fpgas and asics, Proceedings of the 2018 on Great Lakes Symposium on VLSI ser GLSVLSI '18, 353, 10.1145/3194554.3194625 · DOI
  10. chen, 2018, Adaptive mixture of low-rank factorizations for compact neural modeling, Advances in neural information processing systems (CDNNRIA workshop), 10.1007/978-3-030-04167-0 · DOI
  11. li, 2018, Efficient recurrent neural networks using structured matrices in fpgas, CoRR, abs 1803 7661
  12. thomas, 2018, Learning compressed transforms with low displacement rank, Advances in neural information processing systems, 31, 9066
  13. han, 2016, Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding, International Conference on Learning Representations (ICLR)
  14. thakker, 2019, Measuring scheduling efficiency of rnns for NLP applications, CoRR, abs 1904 3302

Cited by

See all 24

Metadata

Authors
Thakker, U., Beu, J., Gope, D., Dasika, G., & Mattina, M.
Venue
2019 2nd Workshop on Energy Efficient Machine Learning and Cognitive Computing for Embedded Applications (EMC2)
Publisher
IEEE
Published
2019-02
Pages
26-30
OpenAlex
W2949896761
Cited by
24
References
9
FWCI
1.43
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Run-Time Efficient RNN Compression for Inference on Edge Devices. https://app.cochat.ai/papers/10.1109/emc249363.2019.00013
The paper
Thakker, U., Beu, J., Gope, D., Dasika, G., & Mattina, M. (2019). Run-Time Efficient RNN Compression for Inference on Edge Devices. 2019 2nd Workshop on Energy Efficient Machine Learning and Cognitive Computing for Embedded Applications (EMC2). https://doi.org/10.1109/emc249363.2019.00013

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.