Challenge: Existing methods to compress generative pre-trained language models fail on generative tasks due to homogeneous word embeddings and limited memory.
Approach: They propose a token-level contrastive distillation method to learn distinguishable word embeddings and a module-wise dynamic scaling method to make quantizers adaptive to different modules.
Outcome: The proposed method outperforms the state-of-the-art compression methods on generative PLMs by a clear margin.

Similar Papers

PreQuant: A Task-agnostic Quantization Approach for Pre-trained Language Models (2023.findings-acl)

Copied to clipboard

Challenge: Quantization is a viable solution for pre-trained language models, but most existing methods are task-specific and require customized training and quantization with a large number of trainable parameters.
Approach: They propose a "quantize before fine-tuning" framework that allows for quantization with a large number of trainable parameters on each individual task.
Outcome: The proposed framework is compatible with quantization-aware training and post-training quantization and corrects quantization errors.
Structured Pruning for Efficient Generative Pre-trained Language Models (2023.findings-acl)

Copied to clipboard

Challenge: Large-scale generative Pre-trained Language Models (PLMs) are limited in their deployment in real-world applications.
Approach: They propose to prune the feed-forward networks of generative pre-trained language models to smaller widths without designing extra operators.
Outcome: The proposed method achieves 1.51x/6.96x inference speedup on GPU/CPU with 67% size reduction.
Self-calibration for Language Model Quantization and Pruning (2025.naacl-long)

Copied to clipboard

Challenge: Quantization and pruning are fundamental approaches for model compression, but they require large computational resources.
Approach: They propose to use model calibration data to generate synthetic calibrations to improve model performance.
Outcome: The proposed method outperforms other methods using real data in a post-training setting.
Compressing Large-Scale Transformer-Based Models: A Case Study on BERT (2021.tacl-1)

Copied to clipboard

Challenge: Popular pre-trained Transformers have improved performance for various NLP tasks by sizable margins, but are too resource-hungry and computation-intensive to suit low-capacity devices or applications with strict latency requirements.
Approach: They present a literature review of the compression of Transformers, focusing on the popular BERT model, which has attracted considerable research attention.
Outcome: The proposed models improve Sentiment analysis, paraphrase detection, machine reading comprehension, question answering, text summarization, and other tasks by sizable margins.
On the Way to Lossless Compression of Language Transformers: Exploring Cross-Domain Properties of Quantization (2024.lrec-main)

Copied to clipboard

Challenge: Modern Natural Language Processing models have a huge capacity, but this makes it difficult to employ.
Approach: They propose a method to quantize at least 95% of Transformer weights without access to task-specific data so the drop in performance does not exceed 0.02%.
Outcome: The proposed method quantizes 95% of Transformer weights and corresponding activations to INT8 without access to task-specific data so the drop in performance does not exceed 0.02%.
When Compression Meets Model Compression: Memory-Efficient Double Compression for Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Large language models (LLMs) exhibit excellent performance in various tasks, but memory requirements present a challenge when deploying on memory-limited devices.
Approach: They propose a framework to compress LLM after quantization further, achieving about 2.2x compression ratio.
Outcome: The proposed model can achieve 40% reduction in memory size with negligible loss in accuracy and inference speed.
AlphaTuning: Quantization-Aware Parameter-Efficient Adaptation of Large-Scale Pre-Trained Language Models (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to improve inference efficiency by accelerating model fine-tuning have not been thoroughly explored.
Approach: They propose to combine parameter-efficient adaptation and model compression to accelerate model . they propose to freeze binary parameters and scale scaling factors for target tasks .
Outcome: The proposed algorithm achieves >10x compression ratio under 4-bit quantization and >1,000x reduction in trainable parameters.
Exploring Quantization for Efficient Pre-Training of Transformer Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Quantization has proven to be effective after pre-training and during fine-tuning, but its effects on pre-trainer performance have remained unexplored.
Approach: They propose a linear quantization strategy to be applied during the pre-training of Transformers to improve model efficiency and stability.
Outcome: The proposed method improves model efficiency, stability, and performance while maintaining language modeling ability.
LLMC: Benchmarking Large Language Model Quantization with a Versatile Compression Toolkit (2024.emnlp-industry)

Copied to clipboard

Challenge: Existing quantization techniques have been categorized as 'simple' and 'highly efficient' however, their configurations vary from each other and cannot be fairly compared .
Approach: They propose a plug-and-play compression toolkit to explore the impact of quantization.
Outcome: The proposed toolkit explores the impact of quantization on large language models.
Generating Datasets with Pretrained Language Models (2021.emnlp-main)

Copied to clipboard

Challenge: Recent approaches to obtain high-quality sentence embeddings from pretrained language models require labeled data or finetuned on large set of labeles.
Approach: They propose to use generative abilities of large and high-performing PLMs to generate entire datasets of labeled text pairs from scratch and fine tune much smaller and more efficient models.
Outcome: The proposed approach outperforms baselines on several semantic textual similarity datasets.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations