Neural Speed Reading via Skim-RNN
Not on the map. Why?
Abstract (arXiv)
Inspired by the principles of speed reading, we introduce Skim-RNN, a recurrent neural network (RNN) that dynamically decides to update only a small fraction of the hidden state for relatively unimportant input tokens. Skim-RNN gives computational advantage over an RNN that always updates the entire hidden state. Skim-RNN uses the same input and output interfaces as a standard RNN and can be easily used instead of RNNs in existing models. In our experiments, we show that Skim-RNN can achieve significantly reduced computational cost without losing accuracy compared to standard RNNs across five different natural language tasks. In addition, we demonstrate that the trade-off between accuracy and speed of Skim-RNN can be dynamically controlled during inference time in a stable manner. Our analysis also shows that Skim-RNN running on a single CPU offers lower latency compared to standard RNNs on GPUs.
Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). First posted on arXiv 6 Nov 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 6; 2023: 2; 2024: 1.
14 papers.
Sort:
By area:
- 2022Measuring and Narrowing the Compositionality Gap in Language Modelscited by 1,075
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMscited by 474
- 2021Dynamic Neural Networks: A Surveycited by 408
- 2022Efficient Transformers with Dynamic Token Poolingcited by 76
- 2021A Survey on Green Deep Learningcited by 52
- 2022A Survey on Dynamic Neural Networks for Natural Language Processingcited by 24
- 2022Transkimmer: Transformer Learns to Layer-wise Skimcited by 24
- 2021Block-Skim: Efficient Question Answering for Transformercited by 18
- 2022Efficient Deep Visual and Inertial Odometry with Adaptive Visual Modality Selectioncited by 18
- 2022Flow: Per-Instance Personalized Federated Learning Through Dynamic Routingcited by 6
- 2023Balanced and Explainable Social Media Analysis for Public Health with Large Language Modelscited by 6
- 2021Doping: A technique for efficient compression of LSTM models using sparse structured additive matricescited by 5
- 2024SOI: Scaling Down Computational Complexity by Estimating Partial States of the Model4 Oct 2024
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs3 Oct 2023
- 2023Balanced and Explainable Social Media Analysis for Public Health with Large Language Models12 Sep 2023
- 2022Flow: Per-Instance Personalized Federated Learning Through Dynamic Routing28 Nov 2022
- 2022Efficient Transformers with Dynamic Token Pooling17 Nov 2022
- 2022Measuring and Narrowing the Compositionality Gap in Language Models7 Oct 2022
- 2022Transkimmer: Transformer Learns to Layer-wise Skim15 May 2022
- 2022Efficient Deep Visual and Inertial Odometry with Adaptive Visual Modality Selection12 May 2022
- 2022A Survey on Dynamic Neural Networks for Natural Language Processing15 Feb 2022
- 2021Block-Skim: Efficient Question Answering for Transformer16 Dec 2021
- 2021A Survey on Green Deep Learning8 Nov 2021
- 2021Part & Whole Extraction: Towards A Deep Understanding of Quantitative Facts for Percentages in Text26 Oct 2021
2 more
- 2022Measuring and Narrowing the Compositionality Gap in Language Modelscited by 1,075
- 2021Dynamic Neural Networks: A Surveycited by 408
- 2022Efficient Transformers with Dynamic Token Poolingcited by 76
- 2021A Survey on Green Deep Learningcited by 52
- 2022A Survey on Dynamic Neural Networks for Natural Language Processingcited by 24
- 2022Transkimmer: Transformer Learns to Layer-wise Skimcited by 24
- 2021Block-Skim: Efficient Question Answering for Transformercited by 18
- 2022Efficient Deep Visual and Inertial Odometry with Adaptive Visual Modality Selectioncited by 18
- 2022Flow: Per-Instance Personalized Federated Learning Through Dynamic Routingcited by 6
- 2023Balanced and Explainable Social Media Analysis for Public Health with Large Language Modelscited by 6
- 2021Doping: A technique for efficient compression of LSTM models using sparse structured additive matricescited by 5
- 2021Part & Whole Extraction: Towards A Deep Understanding of Quantitative Facts for Percentages in Textcited by 2
- 2024SOI: Scaling Down Computational Complexity by Estimating Partial States of the Modelcited by 0
- 2024SOI: Scaling Down Computational Complexity by Estimating Partial States of the Model4 Oct 2024
- 2023Balanced and Explainable Social Media Analysis for Public Health with Large Language Models12 Sep 2023
- 2022Flow: Per-Instance Personalized Federated Learning Through Dynamic Routing28 Nov 2022
- 2022Efficient Transformers with Dynamic Token Pooling17 Nov 2022
- 2022Transkimmer: Transformer Learns to Layer-wise Skim15 May 2022
- 2022Efficient Deep Visual and Inertial Odometry with Adaptive Visual Modality Selection12 May 2022
- 2022A Survey on Dynamic Neural Networks for Natural Language Processing15 Feb 2022
- 2021Block-Skim: Efficient Question Answering for Transformer16 Dec 2021
- 2021A Survey on Green Deep Learning8 Nov 2021
- 2021Part & Whole Extraction: Towards A Deep Understanding of Quantitative Facts for Percentages in Text26 Oct 2021
- 2021Doping: A technique for efficient compression of LSTM models using sparse structured additive matrices14 Feb 2021
- 2021Dynamic Neural Networks: A Survey9 Feb 2021