Compressing a Flag to 11 Bits
Summary
The article discusses a method for compressing a boolean flag into 11 bits, focusing on efficient data encoding techniques.
Similar Articles
How to pack ternary numbers in 8-bit bytes
A blog post describing an efficient method to pack ternary numbers into 8-bit bytes using SIMD-friendly unpacking, achieving 1.6 bits per trit, with applications in LLM weight quantization like BitNet b1.58.
Packing Binary Is Fun
The article describes building a custom binary format to reduce JSON data size by 80%, resulting in the creation of jBin, a binary schema language for efficient data packing.
Compress and Forget: bitsandbytes Quantization Amplifies Proactive Interference in LLMs
The paper finds that bitsandbytes INT4 quantization significantly amplifies proactive interference in LLMs, degrading accuracy in contexts with repeated overwrites and highlighting deployment risks for semantically dense applications.
Sub-1-Bit LLM Compression via Latent Factorization
Samsung Labs 释出 LittleBit 项目（NeurIPS 2025 / ICML 2026），通过潜在空间低秩分解与二值化实现大语言模型的亚 1-bit（低至 0.1 bpw）压缩，并在 LittleBit-2 中引入 Joint-ITQ 潜在几何对齐初始化以提升性能。
Signed Symmetric Quantization for Few-Bit Integers
This paper proposes signed symmetric quantization for few-bit integers, which assigns the extra representable value to the dominant outlier tail, improving quantization error and perplexity in LLMs with no extra inference cost compared to standard symmetric quantization.