paper-with-me

Papers

PreQuant: A Task-agnostic Quantization Approach for Pre-trained Language Models

2023-05-30 · Zhuocheng Gong, Jiahao Liu, Qifan Wang, Yang Yang, Jingang Wang, Wei Wu, Yunsen Xian, Dongyan Zhao, Rui Yan

While transformer-based pre-trained language models (PLMs) have dominated a number of NLP applications, these models are heavy to deploy and expensive to use. Therefore, effectively compressing large-scale PLMs becomes an increasingly important problem. Quantization, which represents high-precision tensors with low-bit fix-point format, is a viable solution. However, most existing quantization methods are task-specific, requiring customized training and quantization with a large number of trainable parameters on each individual task. Inspired by the observation that the over-parameterization nature of PLMs makes it possible to freeze most of the parameters during the fine-tuning stage, in this work, we propose a novel ``quantize before fine-tuning'' framework, PreQuant, that differs from both quantization-aware training and post-training quantization. PreQuant is compatible with various quantization strategies, with outlier-aware parameter-efficient fine-tuning incorporated to correct the induced quantization error. We demonstrate the effectiveness of PreQuant on the GLUE benchmark using BERT, RoBERTa, and T5. We also provide an empirical investigation into the workflow of PreQuant, which sheds light on its efficacy.

📄 PDF Abstract BibTeX arXiv:2306.00014

Code (0)

등록된 구현이 없습니다.

Tasks

parameter-efficient fine-tuningQuantization

Methods 이 논문이 사용한 방법론

Gated Linear Unit A Gated Linear Unit, or GLU computes: $$ \mathrm{GLU}(a, b) = a \otimes \sigma(b) $$ It is used in natural language processing architectures, for example the Gated CNN,…
Multi-Head Attention 설명 없음
Attention 설명 없음
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.
Residual Connection 설명 없음
SentencePiece 설명 없음

Similar Papers 제목 키워드 기반

High-throughput Onboard Hyperspectral Image Compression with Ground-based CNN Reconstruction

2019-07-05 · Diego Valsesia, Enrico Magli

Compression of hyperspectral images onboard of spacecrafts is a tradeoff between the limited computational resources and the ever-growing spatial and spectral resolution of the optical instruments. As such, it requires l…

Image CompressionVocal Bursts Intensity Prediction

An Investigation on Different Underlying Quantization Schemes for Pre-trained Language Models

2020-10-14 · Zihan Zhao, Yuncong Liu, Lu Chen, Qi Liu 외

Recently, pre-trained language models like BERT have shown promising performance on multiple natural language processing tasks. However, the application of these models has been limited due to their huge size. To reduce …

ClusteringQuantization

Resource-efficient medical image classification for edge devices

2025-12-19 · Mahsa Lavaei, Zahra Abadi, Salar Beigzad, Alireza Maleki arxiv

Medical image classification is a critical task in healthcare, enabling accurate and timely diagnosis. However, deploying deep learning models on resource-constrained edge devices presents significant challenges due to c…

Medical Image Classification

IO-SVD: Input-Output Whitened SVD for Adaptive-Rank LLM Compression

2026-05-15 · Ali Abbasi, Chayne Thrash, Haoran Qin, Hamed Pirsiavash 외 arxiv

Large language models deliver strong performance across language and reasoning tasks, but their storage and compute costs remain major barriers to deployment in resource-constrained and latency-sensitive settings. SVD-ba…

TaskPress: Query-Agnostic KV Cache Compression via Task-Guided Pruning

2026-08-04 · Wonpyo Park, Seung-won Hwang arxiv

Long-context inference with large language models is constrained by the linear growth of the key-value cache to sequence length. While pruning offers mitigation, prevailing methods determine query-specific token importan…