mlsanityData to 7 Oct 2026

LO-BCQ: Block Clustered Quantization for 4-bit (W4A4) LLM Inference

arXiv 2502.05376 ↗First posted 7 Feb 2025cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Post-training quantization (PTQ) is a promising approach to reducing the storage and computational requirements of large language models (LLMs) without additional training cost. Recent PTQ studies have primarily focused on quantizing only weights to sub-8-bits while maintaining activations at 8-bits or higher. Accurate sub-8-bit quantization for both weights and activations without relying on quantization-aware training remains a significant challenge. We propose a novel quantization method called block clustered quantization (BCQ) wherein each operand tensor is decomposed into blocks (a block is a group of contiguous scalars), blocks are clustered based on their statistics, and a dedicated optimal quantization codebook is designed for each cluster. As a specific embodiment of this approach, we propose a PTQ algorithm called Locally-Optimal BCQ (LO-BCQ) that iterates between the steps of block clustering and codebook design to greedily minimize the quantization mean squared error. When weight and activation scalars are encoded to W4A4 format (with 0.5-bits of overhead for storing scaling factors and codebook selectors), we advance the current state-of-the-art by demonstrating <1% loss in inference accuracy across several LLMs and downstream tasks.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 24 of its 37 references that are in the map. First posted on arXiv 7 Feb 2025.

Builds on

24 of 37 references.

References · 24

  1. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  2. 2016Pointer Sentinel Mixture Modelscited by 2,992
  3. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  4. 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,829
  5. 2024QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMscited by 598
  6. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
  7. 2023OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Modelscited by 403
  8. 2024QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebookscited by 354
  9. 2023Atom: Low-bit Quantization for Efficient and Accurate LLM Servingcited by 255
  10. 2024Extreme Compression of Large Language Models via Additive Quantizationcited by 223
  11. 2020Integer Quantization for Deep Learning Inference: Principles and Empirical Evaluationcited by 183
  12. 2022Outlier Suppression: Pushing the Limit of Low-bit Transformer Language Modelscited by 176
12 more
  1. 2023OliVe: Accelerating Large Language Models via Hardware-friendly Outlier-Victim Pair Quantizationcited by 83
  2. 2023ZeroQuant-V2: Exploring Post-training Quantization in LLMs from Comprehensive Study to Low Rank Compensationcited by 78
  3. 2024GPTVQ: The Blessing of Dimensionality for LLM Quantizationcited by 78
  4. 2021VS-Quant: Per-vector Scaled Quantization for Accurate Low-Precision Neural Network Inferencecited by 59
  5. 2023With Shared Microexponents, A Little Shifting Goes a Long Waycited by 47
  6. 2023ZeroQuant-FP: A Leap Forward in LLMs Post-Training W4A8 Quantization Using Floating-Point Formatscited by 44
  7. 2021Towards Efficient Post-training Quantization of Pre-trained Language Modelscited by 37
  8. 2024Nemotron-4 15B Technical Reportcited by 36
  9. 2021DKM: Differentiable K-Means Clustering Layer for Neural Network Compressioncited by 31
  10. 2022Optimal Clipping and Magnitude-aware Differentiation for Improved Quantization-aware Trainingcited by 26
  11. 2023FineQuant: Unlocking Efficiency with Fine-Grained Weight-Only Quantization for LLMscited by 22
  12. 2022Mokey: Enabling Narrow Fixed-Point Inference for Out-of-the-Box Floating-Point Transformer Modelscited by 16

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 5.

6 papers.