mlsanityData to 14 Oct 2026

BARQ: Balanced Codebook Refinement for Low-Bit LLM Quantization

arXiv 2610.04490 ↗First posted 3 Oct 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

As large language models (LLMs) grow in parameter count, model storage and parameter memory traffic have become major bottlenecks to efficient deployment. Codebook-based weight quantization reduces these costs, but imbalanced nearest-codeword assignments during fitting can leave some codewords insufficiently updated, limiting effective codebook utilization. To address this limitation, we propose Balanced Assignment Refinement for Quantization (BARQ), which improves quantization quality through balanced fitting of existing codebooks. Specifically, we first compute joint soft assignments between weight blocks and codewords through entropically regularized optimal transport with uniform marginals and curvature-weighted reconstruction costs, ensuring equal positive fitting mass for every codeword in the exact solution. We then refine the codewords through an assignment-weighted barycentric update, which we prove minimizes the fitting objective for fixed assignments. For finite Sinkhorn iterations, the implemented update retains this optimality provided all codeword masses exceed the denominator floor. Finally, we discard the soft assignments and use the refined codebook for standard hard nearest-codeword encoding, with our analysis establishing sufficient conditions for reducing hard-quantization distortion and evaluation loss. Across multiple LLMs, BARQ achieves lower perplexity and higher mean zero-shot accuracy than the evaluated baselines at comparable bit budgets. The code is available at https://github.com/chenhangcuisg-code/BARQ.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 33 of its 47 references that are in the map. First posted on arXiv 3 Oct 2026.

Builds on

33 of 47 references.

References · 33

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2025Qwen3 Technical Reportcited by 8,820
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  4. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  5. 2016Pointer Sentinel Mixture Modelscited by 3,096
  6. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  7. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,857
  8. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  9. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  10. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
  11. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
  12. 2018Computational Optimal Transportcited by 780
21 more
  1. 2024QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMscited by 634
  2. 2019Self-labelling via simultaneous clustering and representation learningcited by 528
  3. 2024SpinQuant: LLM quantization with learned rotationscited by 471
  4. 2023OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Modelscited by 424
  5. 2023QuIP: 2-Bit Quantization of Large Language Models With Guaranteescited by 414
  6. 2024QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebookscited by 378
  7. 2023SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compressioncited by 367
  8. 2017Learning Generative Models with Sinkhorn Divergencescited by 314
  9. 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 294
  10. 2024Extreme Compression of Large Language Models via Additive Quantizationcited by 232
  11. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 223
  12. 2015Learning with a Wasserstein Losscited by 196
  13. 2018Learning Latent Permutations with Gumbel-Sinkhorn Networkscited by 175
  14. 2024GPTVQ: The Blessing of Dimensionality for LLM Quantizationcited by 82
  15. 2019On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithmscited by 62
  16. 2024PV-Tuning: Beyond Straight-Through Estimation for Extreme LLM Compressioncited by 61
  17. 2024VPTQ: Extreme Low-bit Vector Post-Training Quantization for Large Language Modelscited by 57
  18. 2024Fine-Grained Verifiers: Preference Modeling as Next-token Prediction in Vision-Language Alignmentcited by 19
  19. 2025Where Culture Fades: Revealing the Cultural Gap in Text-to-Image Generationcited by 11
  20. 2026TraceRouter: Robust Safety for Large Foundation Models via Path-Level Interventioncited by 11
  21. 2026Transport and Merge: Cross-Architecture Merging for Large Language Modelscited by 7

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024LCQ: Low-Rank Codebook based Quantization for Large Language Models
  2. 2025CCQ: Convolutional Code for Extreme Low-bit Quantization in LLMs
  3. 2026ScaleBITS: Scalable Bitwidth Search for Hardware-Aligned Mixed-Precision LLMs
  4. 2026All for 1-Bit: Towards Genuine 1-Bit Post-Training Quantization for LLMs
  5. 2026AAAC: Activation-Aware Adaptive Codebooks for 4-bit LLM Weight Quantization
  6. 2025SDQ-LLM: Sigma-Delta Quantization for 1-bit LLMs of any size
  7. 2023PB-LLM: Partially Binarized Large Language Models
  8. 2025Q-Palette: Fractional-Bit Quantizers Toward Optimal Bit Allocation for Efficient LLM Deployment