Papers › QLLM: Accurate and Efficient Low-Bitwidth Quantization for Large Language Models

QLLM: Accurate and Efficient Low-Bitwidth Quantization for Large Language Models

12 Oct 2023arXiv:2310.08041archive 2025-07-28

Jing Liu, Ruihao Gong, Xiuying Wei, Zhiwei Dong, Jianfei Cai, Bohan Zhuang

Large Language Models (LLMs) excel in NLP, but their demands hinder their widespread deployment. While Quantization-Aware Training (QAT) offers a solution, its extensive training costs make Post-Training Quantization (PTQ) a more practical approach for LLMs. In existing studies, activation outliers in particular channels are identified as the bottleneck to PTQ accuracy. They propose to transform the magnitudes from activations to weights, which however offers limited alleviation or suffers from unstable gradients, resulting in a severe performance drop at low-bitwidth. In this paper, we propose QLLM, an accurate and efficient low-bitwidth PTQ method designed for LLMs. QLLM introduces an adaptive channel reassembly technique that reallocates the magnitude of outliers to other channels, thereby mitigating their impact on the quantization range. This is achieved by channel disassembly and channel assembly, which first breaks down the outlier channels into several sub-channels to ensure a more balanced distribution of activation magnitudes. Then similar channels are merged to maintain the original channel number for efficiency. Additionally, an adaptive strategy is designed to autonomously determine the optimal number of sub-channels for channel disassembly. To further compensate for the performance loss caused by quantization, we propose an efficient tuning method that only learns a small number of low-rank weights while freezing the pre-trained quantized model. After training, these low-rank parameters can be fused into the frozen weights without affecting inference. Extensive experiments on LLaMA-1 and LLaMA-2 show that QLLM can obtain accurate quantized models efficiently. For example, QLLM quantizes the 4-bit LLaMA-2-70B within 10 hours on a single A100-80G GPU, outperforming the previous state-of-the-art method by 7.89% on the average accuracy across five zero-shot tasks.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2310.08041")

Code

Syntology Ran 7 of 16 code samples harvested from 2 repositories linked to this paper; 9 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 6 ran with no contract checked.

By repository: official repository: 15 samples from 1 repository, 7 ran; community: 1 sample from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

modeltc/qllm officialmentioned in papermentioned on GitHubpytorchApache-2.0 report
ziplab/qllm officialmentioned in papermentioned on GitHubpytorchApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

16 samples harvested; 7 ran; 0 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
6ran
9unverified

Licence: 0 of the 16 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

assembly modeltc/qllm/assembly/ca_module.py official repository ran Apache-2.0 (permissive) · de4a0bd85bb546f8 · report
do_nothing modeltc/qllm/assembly/ca_module.py official repository ran fingerprinted Apache-2.0 (permissive) · 356d0dfdff3db93a · report
find_layers modeltc/qllm/models/models_utils.py official repository ran Apache-2.0 (permissive) · 904cd61df2fe8fb9 · report
make_disjoint_window modeltc/qllm/models/models_utils.py official repository ran Apache-2.0 (permissive) · 4df9168e0a0c38eb · report
sort_layers_by_params modeltc/qllm/parallel_utils.py official repository ran Apache-2.0 (permissive) · e5e341cb2fd0757b · report
truncate_number modeltc/qllm/models/transformation.py official repository ran · our draft was wrong fingerprinted Apache-2.0 (permissive) · 94587954e392b665 · report
truncate_number modeltc/qllm/models/models_utils.py official repository ran fingerprinted Apache-2.0 (permissive) · 4e53fbbdfa160f7d · report
apply_rotary_pos_emb_k modeltc/qllm/models/int_llama_layer.py official repository unverified Apache-2.0 (permissive) · 08e5e88401071307 · report
apply_rotary_pos_emb_q modeltc/qllm/models/int_llama_layer.py official repository unverified Apache-2.0 (permissive) · 69b6e7d6c2228088 · report
assign_layers_to_gpus modeltc/qllm/parallel_utils.py official repository unverified Apache-2.0 (permissive) · b4401e4eaf52f123 · report
bipartite_soft_matching_x_w modeltc/qllm/assembly/ca_module.py official repository unverified Apache-2.0 (permissive) · aa4f281a4d0a2c47 · report
get_lowest_occupied_gpu modeltc/qllm/parallel_utils.py official repository unverified Apache-2.0 (permissive) · 90df7d0b5fc6bf9a · report
get_pile modeltc/qllm/datautils.py official repository unverified Apache-2.0 (permissive) · 2b6e5673cf2914c8 · report
get_ptb modeltc/qllm/datautils.py official repository unverified Apache-2.0 (permissive) · 1b68bae7cd1dd862 · report
get_wikitext2 modeltc/qllm/datautils.py official repository unverified Apache-2.0 (permissive) · 78a5251d494aa3a6 · report
gen_rand_orthos wejoncy/QLLM/qllm/quantization/method.py community unverified Apache-2.0 (permissive) · a4eda67b643f2d95 · report

Tasks

Quantization

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections