Challenge: Existing methods for fine-tuned large language models fail on fine-scale datasets . large data scale amplifies delta parameter magnitude, singular values, and entropy, causing compression errors.
Approach: They propose a training- and data-free delta compression method that captures dominant delta structure and compensates residual low-rank approximation to recover fine-grained details from smaller residual error.
Outcome: The proposed method outperforms existing methods on large-scale datasets on dense and MoE architectures.

Similar Papers

RQT: Hierarchical Residual Quantization for Multi-Model Compression (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for decomposing fine-tuned LLMs are sensitive to the magnitude of delta values.
Approach: They propose a hierarchical quantization framework that shares low-bit integer weights across similar models.
Outcome: The proposed framework achieves an average accuracy degradation of approximately 3% on fine-tuned models across mathematics, coding, chatbot, and Chinese LLMs.
LLM-QAT: Data-Free Quantization Aware Training for Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Several post-training quantization methods have been shown to perform well down to 8-bits.
Approach: They propose a data-free distillation method that leverages generations produced by the pre-trained model to quantize any generative model independent of its training data.
Outcome: The proposed method outperforms SoTA PTQ and LLaMA models at low bit precision.
DL-QAT: Weight-Decomposed Low-Rank Quantization-Aware Training for Large Language Models (2024.emnlp-industry)

Copied to clipboard

Challenge: Quantization-aware Training (QAT) is a popular technique for reducing memory usage and improving computational efficiency in large language models.
Approach: They propose a weight-decomposed low-rank quantization-aware training approach that integrates QAT with a group-specific quantization magnitude adjustment.
Outcome: The proposed method outperforms the state-of-the-art method on LLaMA and LLama2 models.
Can Post-Training Quantization Benefit from an Additional QLoRA Integration? (2025.naacl-industry)

Copied to clipboard

Challenge: Large language models require considerable computing resources, which can be costly and often unavailable.
Approach: They propose to integrate 4-bit Post-training Quantization with QLoRA to address these issues . they demonstrate that the integration outperforms standard quantization and fine-tuning .
Outcome: The proposed integration outperforms standard PTQ and 16-bit full-parameter fine-tuning on LLMs.
One QuantLLM for ALL: Fine-tuning Quantized LLMs Once for Efficient Deployments (2025.acl-long)

Copied to clipboard

Challenge: Quantization has shown promise for Large Language Models, but current methods require lengthy training to alleviate quantization loss.
Approach: They propose to decouple weights and incorporate Low-Rank adapters to reduce weight sharing . they validate the approach on LLaMA2 families and Mistral on downstream evaluation .
Outcome: The proposed approach shows high performance while reducing deployment time faced with multiple scenarios.
VPTQ: Extreme Low-bit Vector Post-Training Quantization for Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Recent research has focused on pushing weight-only quantization to extremely low-bit due to numerical representation limitations.
Approach: They propose a vector-based quantization approach that pushes LLMs to extremely low-bit . they propose scalar-based weight quantization that reduces memory requirements and optimizes storage costs .
Outcome: The proposed method reduces model quantization perplexity by 0.01-0.34 on LLaMA-2, 0.38-0.68 on mistral-7B, 4.41-7.34, on llaMA-3 on QA tasks on average.
FLRC: Fine-grained Low-Rank Compressor for Efficient LLM Inference (2025.emnlp-main)

Copied to clipboard

Challenge: Low-rank compression can reduce memory usage and computational demand, but results are poor during decoding.
Approach: They propose a fine-grained low-rank compression algorithm that determines optimal rank allocation for each layer and incorporates progressive low-ranked decoding to maintain text generation quality.
Outcome: The proposed approach outperforms state-of-the-art methods on summarization tasks and on understanding tasks.
HIGGS: Pushing the Limits of Large Language Model Quantization via the Linearity Theorem (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods for quantizing large language models focus on breaking down the problem into layer-wise sub-problems and minimizing per-layer error, but this approach lacks theoretical justification and the metrics employed may be sub-optimal.
Approach: They propose a "linearity theorem" establishing a direct relationship between the layer-wise reconstruction error and the model perplexity increase due to quantization.
Outcome: The proposed method outperforms previous data-free methods and improves accuracy-compression trade-offs on Llama-family models.
A Comprehensive Evaluation of Quantization Strategies for Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Quantization studies have focused on instruction-tuned LLMs, leaving their performance on other benchmarks unclear.
Approach: They propose a framework to evaluate quantized large language models using four dimensions . they propose to reduce the bits needed for model weights or activations with minimal performance loss .
Outcome: The proposed framework can retain comparable performance to non-quantized LLMs on most benchmarks.
L4Q: Parameter Efficient Quantization-Aware Fine-Tuning on Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Quantization-aware PEFT methods have been developed to reduce memory and computational costs associated with large language models.
Approach: They propose a method that integrates Quantization-Aware Training (QAT) with LoRA to reduce memory overhead and improve model accuracy.
Outcome: The proposed method significantly reduces QAT’s memory overhead while preserving the advantage of QAT in producing fully quantized LLMs with high accuracy.

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