Challenge: Large Language Models typically rely on a large number of parameters for token embedding, leading to substantial storage requirements and memory footprints.
Approach: They propose a corrective Adaptor with group Residual Vector Quantization that can be used to compress the embedding layer without requiring specialized hardware.
Outcome: The proposed corrective adaptor can achieve lower average bitwidth-per-parameter while maintaining reasonable perplexity and accuracy compared to scalar quantization.

Similar Papers

SCVQ: Sparse-Compensated Vector Quantization for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing vector quantization methods incur inference overhead due to massive codebook storage and intensive index lookups.
Approach: They propose a framework for vector quantization that incorporates a salience-aware weighted K-means clustering scheme with symmetry constraints to reduce codebook size and indexing costs.
Outcome: The proposed framework achieves a perplexity of 5.78 on WikiText-2 for LLaMA-2-7B at 2-bit quantization while delivering a 1.4 speedup over existing baselines.
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.
ARCQuant: Boosting NVFP4 Quantization with Augmented Residual Channels for LLMs (2026.acl-long)

Copied to clipboard

Challenge: NVFP4 supports fine-grained block isolation, 4-bit quantization errors and mixed-precision approaches . ARCQuant boosts NVFO4 performance via Augmented Residual Channels .
Approach: They propose a framework that boosts NVFP4 performance via Augmented Residual Channels.
Outcome: ARCQuant boosts NVFP4 performance via Augmented Residual Channels . the proposed framework achieves state-of-the-art accuracy comparable to full-precision baselines compared to FP16 .
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.
FAQ: Mitigating Quantization Error via Regenerating Calibration Data with Family-Aware Quantization (2026.findings-acl)

Copied to clipboard

Challenge: representativeness and universality of calibration data remain a bottleneck in quantization accuracy.
Approach: They propose a framework that leverages prior knowledge from LLMs to generate calibration samples . their framework reduces accuracy loss by up to 28.5% compared to baseline .
Outcome: Experiments show that family-aware quantization reduces accuracy loss by up to 28.5% compared to baseline data.
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.
Achieving binary weight and activation for LLMs using Post-Training Quantization (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for quantizing large language models suffer from performance degradation when weights are quantized to 1 bit.
Approach: They propose a post-training quantization framework with W(1+1)A(14) configuration . they propose utilizing Hessian-aware fine-grained grouping along with an EM-based quantization scheme .
Outcome: The proposed method surpasses state-of-the-art (SOTA) LLM quantization baselines on W2A4 across multiple tasks.
Beyond Dynamic Quantization: An Efficient Static Hierarchical Mix-precision Framework for Near-Lossless LLM Compression (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing methods for dynamic quantization are hardware-unfriendly and often lead to large quantization errors in static scenarios.
Approach: They propose a Static Hierarchical Mix-precision Quantization method which quantifies both inter-layer and intra-layer sensitivity through unified derivations involving Hessian.
Outcome: The proposed method achieves 75.58% on zero-shot reasoning tasks while yielding average speedup of 2.86.
BWLA: Breaking the Barrier of W1AX Post-Training Quantization for LLMs (2026.acl-long)

Copied to clipboard

Challenge: Large language models have driven major progress in NLP, but memory and compute requirements hinder practical deployment.
Approach: They propose a framework that preserves high accuracy while achieving 1-bit weight quantization . the orthogonal-kronecker transformation learns an orthogonale mapping via EM minimization - a new approach to quantization is proposed .
Outcome: The proposed framework achieves 1-bit weight quantization with low activations with low-bit activations.
LLM-FP4: 4-Bit Floating-Point Quantized Transformers (2023.emnlp-main)

Copied to clipboard

Challenge: Existing quantization solutions are integer-based and struggle with bit widths below 8 bits.
Approach: They propose a method for quantizing weights and activations in large language models down to 4-bit floating-point values in a post-training manner.
Outcome: The proposed method outperforms existing methods on common sense zero-shot reasoning tasks by 12.7 points.

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