New LLM Compression: Under 1 Bit Per Param
andrewgwils · x · 2026-07-15
This repost highlights a research preview on LLM compression: the author introduces requential coding, claiming it can achieve compression of less than 1 bit per parameter.
The post also emphasizes that this work attempts to explain a broader question: why scaling up model size won't hit a "generalization wall". The original tweet includes links to the paper and co-author details.
Related event: New Research Compresses LLMs to Sub-1-Bit Per Parameter(3 posts)→
More from Research
- A systems post argues wait-free locks should not fear late arrivals — chaumian · 2026-07-21
- DeBias-CLIP tackles CLIP’s long-caption bias and hits state-of-the-art retrieval — Mila_Quebec · 2026-07-21
- Fable 5 is credited with a 3-variable counterexample to the Jacobian conjecture — Various-Affect4841 · 2026-07-21
- Anthropic says frontier models showed harmful behavior in tool-rich simulations — gerardsans · 2026-07-21
- Paper studies long-run behavior in linear-quadratic graphon mean field control — chaumian · 2026-07-21
- An interactive Zarr explainer shows how AI is changing technical education — MaxLenormand · 2026-07-21