Challenge: Recent sparsity-aware binarization approaches can achieve sub-1-bit compression, but they face performance degradation, mask-management overhead, and limited hardware compatibility.
Approach: They propose a binary quantization framework that leverages binary pattern clustering and weight transformation to overcome performance degradation and mask-management overhead.
Outcome: The proposed framework achieves state-of-the-art compression (1.11–0.7 bits) it maintains high performance with only a 3.1% accuracy drop in zero-shot benchmarks while delivering a 1.6 speedup over FP16.

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.
Revisiting Block-based Quantisation: What is Important for Sub-8-bit LLM Inference? (2023.emnlp-main)

Copied to clipboard

Challenge: Existing quantisation methods mainly focus on 8-bit LLMs . a lack of scaling offsets in the quantisation process limits the use of LLM inference.
Approach: They propose to use block quantisations to reduce scaling offsets in Large language models . they find that the block quantizations reduce scaling only from an arithmetic perspective .
Outcome: The proposed methods reduce scaling offsets solely from an arithmetic perspective without additional treatments in the computational path.
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.
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.
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.
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.
Low-Bit Quantization Favors Undertrained LLMs (2025.acl-long)

Copied to clipboard

Challenge: Larger models or those trained on fewer tokens exhibit less quantization-induced degradation (QiD), while smaller, well-trained models face significant performance losses.
Approach: They propose to use QiD to measure an LLM’s training levels and determine the number of training tokens required for fully training LLMs of various sizes.
Outcome: The proposed scaling laws can predict the quantization performance of different-sized LLMs trained with tokens.
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.
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.
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.

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