Pith. sign in

REVIEW 7 cited by

BiLLM: Pushing the Limit of Post-Training Quantization for LLMs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.04291 v2 pith:BQOJNPVY submitted 2024-02-06 cs.LG cs.AIcs.CL

classification cs.LGcs.AIcs.CL
keywords billmllmsweightsquantizationbinarizationcompressiondistributionfirst
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Pretrained large language models (LLMs) exhibit exceptional general language processing capabilities but come with significant demands on memory and computational resources. As a powerful compression technology, binarization can extremely reduce model weights to a mere 1 bit, lowering the expensive computation and memory requirements. However, existing quantization techniques fall short of maintaining LLM performance under ultra-low bit-widths. In response to this challenge, we present BiLLM, a groundbreaking 1-bit post-training quantization scheme tailored for pretrained LLMs. Based on the weight distribution of LLMs, BiLLM first identifies and structurally selects salient weights, and minimizes the compression loss through an effective binary residual approximation strategy. Moreover, considering the bell-shaped distribution of the non-salient weights, we propose an optimal splitting search to group and binarize them accurately. BiLLM achieving for the first time high-accuracy inference (e.g. 8.41 perplexity on LLaMA2-70B) with only 1.08-bit weights across various LLMs families and evaluation metrics, outperforms SOTA quantization methods of LLM by significant margins. Moreover, BiLLM enables the binarization process of the LLM with 7 billion weights within 0.5 hours on a single GPU, demonstrating satisfactory time efficiency. Our code is available at https://github.com/Aaronhuang-778/BiLLM.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Event-Priori-Based Vision-Language Model for Efficient Visual Understanding

    cs.CV 2025-06 conditional novelty 6.0 of 10

    EP-VLM uses event-camera motion data to sparsify image patches before a vision-language model processes them, cutting FLOPs by about half with a small accuracy drop.

  2. LUQ: Layerwise Ultra-Low Bit Quantization for Multimodal Large Language Models

    cs.CV 2025-09 conditional novelty 5.0 of 10

    LUQ assigns ultra-low bit widths to transformer layers whose output activations have low entropy, cutting multimodal LLM memory by up to 40 percent with modest benchmark loss.

  3. Compress Any Segment Anything Model (SAM)

    cs.CV 2025-07 conditional novelty 5.0 of 10

    Birkhoff compresses 18 SAM variants to about one-fifth their size with less than 1% accuracy loss, data-free, using a trajectory-based codebook and a fused GPU operator.

  4. BiVM: Accurate Binarized Neural Network for Efficient Video Matting

    cs.CV 2025-07 conditional novelty 5.0 of 10

    BiVM is a 1-bit binarized video matting network that beats prior binarized methods on accuracy and efficiency, with 11.82 MAD on VideoMatte240K versus 28.49 for ReActNet-binarized RVM.

  5. Cross-Layer Error Compensation and Finite-Sample Feature-Statistics Matching for Extreme Low-Bit Quantization of Large Language Models

    cs.NE 2026-07 conditional novelty 4.0 of 10

    A whole-network final-feature and statistics matching objective improves 1.125-bit and 4.125-bit LLM quantization over layer-local and distillation baselines, but its cross-layer mechanism reduces exactly to final-fea...

  6. BAQ: Efficient Bit Allocation Quantization for Large Language Models

    cs.LG 2025-06 conditional novelty 4.0 of 10

    BAQ assigns per-column bitwidths to LLM weights by solving a convex quantization-loss problem, and reports large 2-bit perplexity gains over GPTQ.

  7. Efficient Strategy for Improving Large Language Model (LLM) Capabilities

    cs.CL 2025-08 unverdicted novelty 3.0 of 10

    Proposes a combined data-selection, training-strategy, and architecture-adjustment approach to improve LLM capability under resource constraints.

Pith tools