mlsanityData to 7 Oct 2026

No-Skim: Towards Efficiency Robustness Evaluation on Skimming-based Language Models

arXiv 2312.09494 ↗First posted 15 Dec 2023cs.CR cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

To reduce the computation cost and the energy consumption in large language models (LLM), skimming-based acceleration dynamically drops unimportant tokens of the input sequence progressively along layers of the LLM while preserving the tokens of semantic importance. However, our work for the first time reveals the acceleration may be vulnerable to Denial-of-Service (DoS) attacks. In this paper, we propose No-Skim, a general framework to help the owners of skimming-based LLM to understand and measure the robustness of their acceleration scheme. Specifically, our framework searches minimal and unnoticeable perturbations at character-level and token-level to generate adversarial inputs that sufficiently increase the remaining token ratio, thus increasing the computation cost and energy consumption. We systematically evaluate the vulnerability of the skimming acceleration in various LLM architectures including BERT and RoBERTa on the GLUE benchmark. In the worst case, the perturbation found by No-Skim substantially increases the running cost of LLM by over 145% on average. Moreover, No-Skim extends the evaluation framework to various scenarios, making the evaluation conductible with different level of knowledge.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 14 of its 27 references that are in the map. First posted on arXiv 15 Dec 2023.

Builds on

14 of 27 references.

References · 14

  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. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  5. 2017SkipNet: Learning Dynamic Routing in Convolutional Networkscited by 328
  6. 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 322
  7. 2020FastBERT: a Self-distilling BERT with Adaptive Inference Timecited by 224
  8. 2016Spatially Adaptive Computation Time for Residual Networkscited by 118
  9. 2020Length-Adaptive Transformer: Train Once with Length Drop, Use Anytime with Searchcited by 76
  10. 2020A Panda? No, It's a Sloth: Slowdown Attacks on Adaptive Multi-Exit Neural Network Inferencecited by 61
  11. 2017Skip RNN: Learning to Skip State Updates in Recurrent Neural Networkscited by 49
  12. 2022NICGSlowDown: Evaluating the Efficiency Robustness of Neural Image Caption Generation Modelscited by 47
2 more
  1. 2021TR-BERT: Dynamic Token Reduction for Accelerating BERT Inferencecited by 40
  2. 2017Learning to Skim Textcited by 18

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.