Infor-Coef: Information Bottleneck-based Dynamic Token Downsampling for Compact and Efficient language model

Wenxi Tan
5/21/2023
cs.CL

No confident code implementation found for this paper.

Abstract

The prevalence of Transformer-based pre-trained language models (PLMs) has led to their wide adoption for various natural language processing tasks. However, their excessive overhead leads to large latency and computational costs. The statically compression methods allocate fixed computation to different samples, resulting in redundant computation. The dynamic token pruning method selectively shortens the sequences but are unable to change the model size and hardly achieve the speedups as static pruning. In this paper, we propose a model accelaration approaches for large language models that incorporates dynamic token downsampling and static pruning, optimized by the information bottleneck loss. Our model, Infor-Coef, achieves an 18x FLOPs speedup with an accuracy degradation of less than 8\% compared to BERT. This work provides a promising approach to compress and accelerate transformer-based models for NLP tasks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{tan2023inforcoef,
  title  = {Infor-Coef: Information Bottleneck-based Dynamic Token Downsampling for Compact and Efficient language model},
  author = {Wenxi Tan},
  year   = {2023},
  eprint = {2305.12458},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.12458v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.12458.svg)](https://codeofpaper.com/paper/2305.12458)

Discussion