Transkimmer: Transformer Learns to Layer-wise Skim
Not on the map. Why?
Abstract (arXiv)
Transformer architecture has become the de-facto model for many machine learning tasks from natural language processing and computer vision. As such, improving its computational efficiency becomes paramount. One of the major computational inefficiency of Transformer-based models is that they spend the identical amount of computation throughout all layers. Prior works have proposed to augment the Transformer model with the capability of skimming tokens to improve its computational efficiency. However, they suffer from not having effectual and end-to-end optimization of the discrete skimming predictor. To address the above limitations, we propose the Transkimmer architecture, which learns to identify hidden state tokens that are not required by each layer. The skimmed tokens are then forwarded directly to the final output, thus reducing the computation of the successive layers. The key idea in Transkimmer is to add a parameterized predictor before each layer that learns to make the skimming decision. We also propose to adopt reparameterization trick and add skim loss for the end-to-end training of Transkimmer. Transkimmer achieves 10.97x average speedup on GLUE benchmark compared with vanilla BERT-base baseline with less than 1% accuracy degradation.
Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). Builds on 38 of its 47 references that are in the map. First posted on arXiv 15 May 2022.
Builds on
38 of 47 references.
References · 38
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2016Layer Normalizationcited by 5,579
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
26 more
- 2020Reformer: The Efficient Transformercited by 1,658
- 2020Efficient Transformers: A Surveycited by 784
- 2018Universal Transformerscited by 613
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 591
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 322
- 2017A Structured Self-attentive Sentence Embeddingcited by 318
- 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 267
- 2020SpAtten: Efficient Sparse Attention Architecture with Cascade Token and Head Pruningcited by 228
- 2020FastBERT: a Self-distilling BERT with Adaptive Inference Timecited by 224
- 2021Learned Token Pruning for Transformerscited by 138
- 2020Lite Transformer with Long-Short Range Attentioncited by 127
- 2020Length-Adaptive Transformer: Train Once with Length Drop, Use Anytime with Searchcited by 76
- 2015Conditional Deep Learning for Energy-Efficient and Enhanced Pattern Recognitioncited by 67
- 2022SQuant: On-the-Fly Data-Free Quantization via Diagonal Hessian Approximationcited by 51
- 2017Skip RNN: Learning to Skip State Updates in Recurrent Neural Networkscited by 49
- 2020On the Transformer Growth for Progressive BERT Trainingcited by 49
- 2021TR-BERT: Dynamic Token Reduction for Accelerating BERT Inferencecited by 40
- 2020Accelerating Sparse DNN Models without Hardware-Support via Tile-Wise Sparsitycited by 30
- 2020DeFormer: Decomposing Pre-trained Transformers for Faster Question Answeringcited by 29
- 2017Learning to Skim Textcited by 18
- 2019Neural Speed Reading with Structural-Jump-LSTMcited by 17
- 2021Block-Skim: Efficient Question Answering for Transformercited by 16
- 2021EfficientBERT: Progressively Searching Multilayer Perceptron via Warm-up Knowledge Distillationcited by 15
- 2021Magic Pyramid: Accelerating Inference with Early Exiting and Token Pruningcited by 15
- 2017Neural Speed Reading via Skim-RNNcited by 14
- 2020How Far Does BERT Look At:Distance-based Clustering and Analysis of BERT's Attentioncited by 9
Built on by
Citing papers per year: 2022: 2; 2023: 11; 2024: 6; 2025: 2.
21 papers.
Sort:
By area:
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMscited by 466
- 2024Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matterscited by 73
- 2024LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategycited by 50
- 2022ANT: Exploiting Adaptive Numerical Data Type for Low-bit Deep Neural Network Quantizationcited by 42
- 2024MELTing point: Mobile Evaluation of Language Transformerscited by 35
- 2022Efficiently Controlling Multiple Risks with Pareto Testingcited by 21
- 2023Sparse Modular Activation for Efficient Sequence Modelingcited by 20
- 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Modelscited by 19
- 2023OrchestraLLM: Efficient Orchestration of Language Models for Dialogue State Trackingcited by 17
- 2024Nimbus: Secure and Efficient Two-Party Inference for Transformerscited by 15
- 2023Chunk, Align, Select: A Simple Long-sequence Processing Method for Transformerscited by 9
- 2023Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inferencecited by 6
9 more
- 2023SHARCS: Efficient Transformers through Routing with Dynamic Width Sub-networkscited by 6
- 2025Breaking Free from MMI: A New Frontier in Rationalization by Probing Input Utilizationcited by 6
- 2024Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanismcited by 4
- 2023Infor-Coef: Information Bottleneck-based Dynamic Token Downsampling for Compact and Efficient language modelcited by 2
- 2023You Only Forward Once: Prediction and Rationalization in A Single Forward Passcited by 2
- 2023Fovea Transformer: Efficient Long-Context Modeling with Structured Fine-to-Coarse Attentioncited by 2
- 2024Finch: Prompt-guided Key-Value Cache Compressioncited by 2
- 2023Input-length-shortening and text generation via attention valuescited by 1
- 2025AdaVid: Adaptive Video-Language Pretrainingcited by 0
- 2025AdaVid: Adaptive Video-Language Pretraining16 Apr 2025
- 2025Breaking Free from MMI: A New Frontier in Rationalization by Probing Input Utilization8 Mar 2025
- 2024Nimbus: Secure and Efficient Two-Party Inference for Transformers24 Nov 2024
- 2024Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism14 Nov 2024
- 2024LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy4 Oct 2024
- 2024Finch: Prompt-guided Key-Value Cache Compression31 Jul 2024
- 2024Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matters18 Jun 2024
- 2024MELTing point: Mobile Evaluation of Language Transformers19 Mar 2024
- 2023OrchestraLLM: Efficient Orchestration of Language Models for Dialogue State Tracking16 Nov 2023
- 2023Fovea Transformer: Efficient Long-Context Modeling with Structured Fine-to-Coarse Attention13 Nov 2023
- 2023You Only Forward Once: Prediction and Rationalization in A Single Forward Pass4 Nov 2023
- 2023SHARCS: Efficient Transformers through Routing with Dynamic Width Sub-networks18 Oct 2023
9 more
- 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models8 Oct 2023
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs3 Oct 2023
- 2023Chunk, Align, Select: A Simple Long-sequence Processing Method for Transformers25 Aug 2023
- 2023Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inference26 Jun 2023
- 2023Sparse Modular Activation for Efficient Sequence Modeling19 Jun 2023
- 2023Infor-Coef: Information Bottleneck-based Dynamic Token Downsampling for Compact and Efficient language model21 May 2023
- 2023Input-length-shortening and text generation via attention values14 Mar 2023
- 2022Efficiently Controlling Multiple Risks with Pareto Testing14 Oct 2022
- 2022ANT: Exploiting Adaptive Numerical Data Type for Low-bit Deep Neural Network Quantization30 Aug 2022
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMscited by 466
- 2024Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matterscited by 73
- 2024LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategycited by 50
- 2023Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inferencecited by 6
- 2024LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy4 Oct 2024
- 2024Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matters18 Jun 2024
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs3 Oct 2023
- 2023Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inference26 Jun 2023
- 2024Finch: Prompt-guided Key-Value Cache Compressioncited by 2
- 2024Finch: Prompt-guided Key-Value Cache Compression31 Jul 2024
- 2022ANT: Exploiting Adaptive Numerical Data Type for Low-bit Deep Neural Network Quantizationcited by 42
- 2024MELTing point: Mobile Evaluation of Language Transformerscited by 35
- 2022Efficiently Controlling Multiple Risks with Pareto Testingcited by 21
- 2023Sparse Modular Activation for Efficient Sequence Modelingcited by 20
- 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Modelscited by 19
- 2023OrchestraLLM: Efficient Orchestration of Language Models for Dialogue State Trackingcited by 17
- 2024Nimbus: Secure and Efficient Two-Party Inference for Transformerscited by 15
- 2023Chunk, Align, Select: A Simple Long-sequence Processing Method for Transformerscited by 9
- 2023SHARCS: Efficient Transformers through Routing with Dynamic Width Sub-networkscited by 6
- 2025Breaking Free from MMI: A New Frontier in Rationalization by Probing Input Utilizationcited by 6
- 2023Infor-Coef: Information Bottleneck-based Dynamic Token Downsampling for Compact and Efficient language modelcited by 2
- 2023You Only Forward Once: Prediction and Rationalization in A Single Forward Passcited by 2
12 most cited of 15 All 15 (JSON)
- 2025AdaVid: Adaptive Video-Language Pretraining16 Apr 2025
- 2025Breaking Free from MMI: A New Frontier in Rationalization by Probing Input Utilization8 Mar 2025
- 2024Nimbus: Secure and Efficient Two-Party Inference for Transformers24 Nov 2024
- 2024MELTing point: Mobile Evaluation of Language Transformers19 Mar 2024
- 2023OrchestraLLM: Efficient Orchestration of Language Models for Dialogue State Tracking16 Nov 2023
- 2023Fovea Transformer: Efficient Long-Context Modeling with Structured Fine-to-Coarse Attention13 Nov 2023
- 2023You Only Forward Once: Prediction and Rationalization in A Single Forward Pass4 Nov 2023
- 2023SHARCS: Efficient Transformers through Routing with Dynamic Width Sub-networks18 Oct 2023
- 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models8 Oct 2023
- 2023Chunk, Align, Select: A Simple Long-sequence Processing Method for Transformers25 Aug 2023
- 2023Sparse Modular Activation for Efficient Sequence Modeling19 Jun 2023
- 2023Infor-Coef: Information Bottleneck-based Dynamic Token Downsampling for Compact and Efficient language model21 May 2023
12 newest of 15 All 15 (JSON)