Computer Science > Artificial Intelligence
arXiv:2609.16338 (cs)
[Submitted on 14 Sep 2026]
Title:Breaking the 1.58-bit Barrier for Ternary LLMs
Authors: Evangelos Georganas, Alexander Heinecke, Pradeep Dubey
View a PDF of the paper titled Breaking the 1.58-bit Barrier for Ternary LLMs, by Evangelos Georganas and 2 other authors
Abstract:Ternary Large Language Models (LLM) store every weight as one of three symbols {−1,0,+1}, so the cost of a ternary model is conventionally referenced to the information-theoretic log23≈1.585 bits per weight. The prevailing deployment format packs five ternary weights into one byte (five-trit packing), and due to the power-of-two group sizes used in practice this rounds up to 1.625 bits per weight. This effective storage bit-width treats the three symbols {−1,0,+1} as equiprobable. We measure the actual symbol distribution of 29 ternary LLM models and find that zeros account for up to 51.5% of all weights. Motivated by this finding, we introduce BITCOS, a simple distribution-adaptive layout comprised of a dense presence bitmap plus a compacted sign vector, and costs 2−z bits per weight element given a zero density z in the model's weights. BITCOS stores weights more compactly than the five-trit packing in 26 of the 29 tested models, and reaches 1.485 bits per weight on the sparsest of them. BITCOS is amenable to efficient unpacking on modern processors and GPUs, and we present optimized unpacking sequences for AVX-512, AVX2 and Intel Xe2 GPUs. Measured against production state-of-the-art ternary matrix-vector multiplication kernels, at the zero densities real-world ternary models exhibit, the realized gain with our proposed layout is up to 1.28×. Finally, we illustrate end-to-end LLM inference results on 5 different platforms (client and server CPUs, integrated and discrete Xe2 GPUs) where decode throughput improves by up to 1.18× on CPUs and 1.27× on GPUs.
Subjects: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
Cite as: arXiv:2609.16338 [cs.AI]
(or arXiv:2609.16338v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2609.16338arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Evangelos Georganas view email
[v1] Mon, 14 Sep 2026 20:54:24 UTC (144 KB)
Access Paper:
View a PDF of the paper titled Breaking the 1.58-bit Barrier for Ternary LLMs, by Evangelos Georganas and 2 other authors
Current browse context:
cs.AI
Change to browse by:
References & Citations
export BibTeX citation
Code, Data and Media Associated with this Article
Demos
Related Papers
About arXivLabs
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax?)
