When are 1.58 bits enough? A Bottom-up Exploration of BitNet Quantization

Jacob Nielsen, Lukas Galke, Peter Schneider-Kamp
11/8/2024
cs.LGcs.CL

No confident code implementation found for this paper.

Abstract

Contemporary machine learning models, such as language models, are powerful, but come with immense resource requirements both at training and inference time. It has been shown that decoder-only language models can be trained to a competitive state with ternary weights (1.58 bits per weight), facilitating efficient inference. Here, we start our exploration with non-transformer model architectures, investigating 1.58-bit training for multi-layer perceptrons and graph neural networks. Then, we explore 1.58-bit training in other transformer-based language models, namely encoder-only and encoder-decoder models. Our results show that in all of these settings, 1.58-bit training is on par with or sometimes even better than the standard 32/16-bit models.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{nielsen2024when,
  title  = {When are 1.58 bits enough? A Bottom-up Exploration of BitNet Quantization},
  author = {Jacob Nielsen and Lukas Galke and Peter Schneider-Kamp},
  year   = {2024},
  eprint = {2411.05882},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.05882v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.05882.svg)](https://codeofpaper.com/paper/2411.05882)

Discussion