Challenge: Existing methods for implementing large language models are limited by high computational and memory requirements.
Approach: They propose a lightweight binarization framework that achieves effective W(1+1)A4 quantization through a novel three-stage quantization strategy.
Outcome: The proposed framework surpasses state-of-the-art methods on W2A4 quantization settings across languages.

Similar Papers

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.
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-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.
Enhancing Computation Efficiency in Large Language Models through Weight and Activation Quantization (2023.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) are proficient in natural language processing tasks, but their deployment is limited by extensive parameter sizes and computational demands.
Approach: They propose a method to enhance computational efficiency in large language models by 4-bit weight and 8-bit activation quantization.
Outcome: The proposed techniques significantly boost task accuracies to levels comparable with full-precision 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.
LRQ: Optimizing Post-Training Quantization for Large Language Models by Learning Low-Rank Weight-Scaling Matrices (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods for quantizing weights and activations of large language models suffer from non-negligible accuracy drops, especially on massive multitask language understanding.
Approach: They propose a weight-activation quantization method that reconstructs the outputs of an intermediate Transformer block by leveraging low-rank weight-scaling matrices.
Outcome: The proposed method reduces the complexity of the weight-activation quantization techniques while achieving high throughput and reducing inference costs.
PTQ1.61: Push the Real Limit of Extremely Low-Bit Post-Training Quantization Methods for Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for sub 2-bit quantization introduce an extra 1-bit or more per weight.
Approach: They propose a sub 2-bit post-training quantization method that enables weight quantization to 1.61-bit for the first time.
Outcome: The proposed method reduces the upper bound of quantization error to 1.61-bit for the first time.
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.
PE-QAT: Parameter-Efficient Quantization-Aware Training for Large Language Models (2026.acl-srw)

Copied to clipboard

Challenge: Quantization Aware Training (QAT) is expensive to train and unscalable to large models.
Approach: They propose a parameter-efficient framework targeting per-channel 4-bit weight-activation quantization of large language models.
Outcome: The proposed framework preserves accuracy within 0.11 percentage points of the full-precision baseline on Llama-2-7B zero-shot tasks while training only 1.26% of total parameters.
DB-LLM: Accurate Dual-Binarization for Efficient LLMs (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for ultra-low bit quantization cause severe accuracy drops . a novel Dual-Binarization method is proposed for efficient Large Language Models .
Approach: They propose a Dual-Binarization method that takes 2-bit-width and binarization into account . they propose DB-LLM, which uses a 2-bit binarized weighted model to represent weights efficiently .
Outcome: The proposed method surpasses the current State-of-the-Art in ultra-low bit quantization and achieves 20% reduction in computational consumption compared to the SOTA method under the same bit-width.

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