mlsanityData to 7 Oct 2026

Transkimmer: Transformer Learns to Layer-wise Skim

arXiv 2205.07324 ↗First posted 15 May 2022cs.CLcited by 21

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

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  4. 2016Layer Normalizationcited by 5,579
  5. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  6. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  7. 2016Gaussian Error Linear Units (GELUs)cited by 3,431
  8. 2020Longformer: The Long-Document Transformercited by 3,362
  9. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  10. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  11. 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
  12. 2020Big Bird: Transformers for Longer Sequencescited by 1,673
26 more
  1. 2020Reformer: The Efficient Transformercited by 1,658
  2. 2020Efficient Transformers: A Surveycited by 784
  3. 2018Universal Transformerscited by 613
  4. 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 591
  5. 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 322
  6. 2017A Structured Self-attentive Sentence Embeddingcited by 318
  7. 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 267
  8. 2020SpAtten: Efficient Sparse Attention Architecture with Cascade Token and Head Pruningcited by 228
  9. 2020FastBERT: a Self-distilling BERT with Adaptive Inference Timecited by 224
  10. 2021Learned Token Pruning for Transformerscited by 138
  11. 2020Lite Transformer with Long-Short Range Attentioncited by 127
  12. 2020Length-Adaptive Transformer: Train Once with Length Drop, Use Anytime with Searchcited by 76
  13. 2015Conditional Deep Learning for Energy-Efficient and Enhanced Pattern Recognitioncited by 67
  14. 2022SQuant: On-the-Fly Data-Free Quantization via Diagonal Hessian Approximationcited by 51
  15. 2017Skip RNN: Learning to Skip State Updates in Recurrent Neural Networkscited by 49
  16. 2020On the Transformer Growth for Progressive BERT Trainingcited by 49
  17. 2021TR-BERT: Dynamic Token Reduction for Accelerating BERT Inferencecited by 40
  18. 2020Accelerating Sparse DNN Models without Hardware-Support via Tile-Wise Sparsitycited by 30
  19. 2020DeFormer: Decomposing Pre-trained Transformers for Faster Question Answeringcited by 29
  20. 2017Learning to Skim Textcited by 18
  21. 2019Neural Speed Reading with Structural-Jump-LSTMcited by 17
  22. 2021Block-Skim: Efficient Question Answering for Transformercited by 16
  23. 2021EfficientBERT: Progressively Searching Multilayer Perceptron via Warm-up Knowledge Distillationcited by 15
  24. 2021Magic Pyramid: Accelerating Inference with Early Exiting and Token Pruningcited by 15
  25. 2017Neural Speed Reading via Skim-RNNcited by 14
  26. 2020How Far Does BERT Look At:Distance-based Clustering and Analysis of BERT's Attentioncited by 9

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 11; 2024: 6; 2025: 2.

21 papers.

Sort:

By area:

  1. 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMscited by 466
  2. 2024Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matterscited by 73
  3. 2024LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategycited by 50
  4. 2022ANT: Exploiting Adaptive Numerical Data Type for Low-bit Deep Neural Network Quantizationcited by 42
  5. 2024MELTing point: Mobile Evaluation of Language Transformerscited by 35
  6. 2022Efficiently Controlling Multiple Risks with Pareto Testingcited by 21
  7. 2023Sparse Modular Activation for Efficient Sequence Modelingcited by 20
  8. 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Modelscited by 19
  9. 2023OrchestraLLM: Efficient Orchestration of Language Models for Dialogue State Trackingcited by 17
  10. 2024Nimbus: Secure and Efficient Two-Party Inference for Transformerscited by 15
  11. 2023Chunk, Align, Select: A Simple Long-sequence Processing Method for Transformerscited by 9
  12. 2023Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inferencecited by 6
9 more
  1. 2023SHARCS: Efficient Transformers through Routing with Dynamic Width Sub-networkscited by 6
  2. 2025Breaking Free from MMI: A New Frontier in Rationalization by Probing Input Utilizationcited by 6
  3. 2024Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanismcited by 4
  4. 2023Infor-Coef: Information Bottleneck-based Dynamic Token Downsampling for Compact and Efficient language modelcited by 2
  5. 2023You Only Forward Once: Prediction and Rationalization in A Single Forward Passcited by 2
  6. 2023Fovea Transformer: Efficient Long-Context Modeling with Structured Fine-to-Coarse Attentioncited by 2
  7. 2024Finch: Prompt-guided Key-Value Cache Compressioncited by 2
  8. 2023Input-length-shortening and text generation via attention valuescited by 1
  9. 2025AdaVid: Adaptive Video-Language Pretrainingcited by 0