REVIEW 3 cited by
BitNet b1.58 2B4T Technical Report
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
read the original abstract
We introduce BitNet b1.58 2B4T, the first open-source, native 1-bit Large Language Model (LLM) at the 2-billion parameter scale. Trained on a corpus of 4 trillion tokens, the model has been rigorously evaluated across benchmarks covering language understanding, mathematical reasoning, coding proficiency, and conversational ability. Our results demonstrate that BitNet b1.58 2B4T achieves performance on par with leading open-weight, full-precision LLMs of similar size, while offering significant advantages in computational efficiency, including substantially reduced memory footprint, energy consumption, and decoding latency. To facilitate further research and adoption, the model weights are released via Hugging Face along with open-source inference implementations for both GPU and CPU architectures.
Forward citations
Cited by 3 Pith papers
-
When Can Depth Replace Precision? A Resource Theory of Quantized Neural Computation
For a fixed low-bit residual library, the distance to the closed relaxed reachable set is an exact structural floor that pure depth approaches at O(1/D), while write-back arithmetic can reverse the gain and accuracy m...
-
BitNet Text Embeddings
BITEMBED trains 1.58-bit ternary-weight LLM embedders with contrastive pre-training, supervised distillation, and multi-precision output training, matching FP16 teachers within ~0.6 MMTEB points at ~2x CPU speed.
-
Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings
A top-magnitude sign quantisation, grounded in a family of convex polytopes, encodes embeddings as ternary vectors and delivers fast, accurate approximate similarity search.
Discussion (0). Continue with ORCID to comment.