Skipping RNN State Updates without Retraining the Original Model
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Recurrent Neural Networks (RNNs) break a time-series input (or a sentence) into multiple time-steps (or words) and process it one time-step (word) at a time. However, not all of these time-steps (words) need to be processed to determine the final output accurately. Prior work has exploited this intuition by incorporating an additional predictor in front of the RNN model to prune time-steps that are not relevant. However, they jointly train the predictor and the RNN model, allowing one to learn from the mistakes of the other. In this work we present a method to skip RNN time-steps without retraining or fine tuning the original RNN model. Using an ideal predictor, we show that even without retraining the original model, we can train a predictor to skip 45% of steps for the SST dataset and 80% of steps for the IMDB dataset without impacting the model accuracy. We show that the decision to skip is not easy by comparing against 5 different baselines based on solutions derived from domain knowledge. Finally, we present a case study about the cost and accuracy benefits of realizing such a predictor. This realistic predictor on the SST dataset is able to reduce the computation by more than 25% with at most 0.3% loss in accuracy while being 40× smaller than the original RNN model.
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.
Integrity signals
Registry
Cites
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.
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
To prune, or not to prune: exploring the efficacy of pruning for model compression
Zhu, M., & Gupta, S. (2017) · arXiv · doi:10.48550/arxiv.1710.01878 · Cited by 805
The State of Sparsity in Deep Neural Networks
Gale, T., Elsen, E., & Hooker, S. (2019) · arXiv · doi:10.48550/arxiv.1902.09574 · Cited by 440 · cited 1×
“This could be achieved either using low-rank matrix factorization [2, 7, 12], structured matrix compression [3, 13], pruning [5, 20] or quantization [6, 15, 16, 19].”
MethodCompressing RNNs for IoT devices by 15-38x using Kronecker Products
Thakker, U., Beu, J., Gope, D., Zhou, C., Fedorov, I., Dasika, G., & Mattina, M. (2019) · arXiv · doi:10.48550/arxiv.1906.02876 · Cited by 30 · cited 1×
“This could be achieved either using low-rank matrix factorization [2, 7, 12], structured matrix compression [3, 13], pruning [5, 20] or quantization [6, 15, 16, 19].”
MethodSelf-citation
Cited by
Dynamic Neural Networks: A Survey
Han, Y., Huang, G., Song, S., Yang, L., Wang, H., & Wang, Y. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3117837 · Cited by 848
A Survey on Federated Learning for Resource-Constrained IoT Devices
Imteaj, A., Thakker, U., Wang, S., Li, J., & Amini, M. H. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3095077 · Cited by 774
“DLS techniques are more specific to ResNet style architecture with skip connections or RNN-based models ([185], [186]).”
Self-citationCompressing RNNs to Kilobyte Budget for IoT Devices Using Kronecker Products
Thakker, U., Fedorov, I., Zhou, C., Gope, D., Mattina, M., Dasika, G., & Beu, J. (2021) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3440016 · Cited by 8
Self-citationCompressing Language Models using Doped Kronecker Products
Thakker, U., Whatmough, P. N., Liu, Z.-G., Mattina, M., & Beu, J. (2020) · arXiv · doi:10.48550/arxiv.2001.08896 · Cited by 7
Self-citation
Metadata
- Authors
- Tao, J., Thakker, U., Dasika, G., & Beu, J.
- Venue
- Proceedings of the 1st Workshop on Machine Learning on Edge in Sensor Systems
- Publisher
- ACM
- Published
- 2019-11-10
- Pages
- 31-36
- OpenAlex
- W2982011653
- Cited by
- 19
- References
- 3
- FWCI
- 1.18
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Skipping RNN State Updates without Retraining the Original Model. https://app.cochat.ai/papers/10.1145/3362743.3362965
- The paper
- Tao, J., Thakker, U., Dasika, G., & Beu, J. (2019). Skipping RNN State Updates without Retraining the Original Model. Proceedings of the 1st Workshop on Machine Learning on Edge in Sensor Systems. https://doi.org/10.1145/3362743.3362965
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.